Cumulative-Separable Codes
Sergey Bezzateev, Natalia Shekhunova

TL;DR
This paper studies q-ary cumulative-separable codes, exploring their relationships and providing improved bounds on their minimum distance and dimension.
Contribution
It introduces new insights into the structure of cumulative-separable codes and refines bounds on their parameters.
Findings
Demonstrates relations between different codes in the class.
Provides improved bounds for minimum distance.
Provides improved bounds for code dimension.
Abstract
q-ary cumulative-separable -codes and are considered. The relation between different codes from this class is demonstrated. Improved boundaries of the minimum distance and dimension are obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Embedded Systems Design Techniques · Radiation Effects in Electronics
