The $b$-weight distribution for MDS codes
Canze Zhu, Qunying Liao

TL;DR
This paper extends the understanding of the weight distribution of MDS codes within the new $b$-symbol coding framework, connecting it to the properties of shortened MDS codes and generalizing previous results.
Contribution
It establishes a general method to determine the $b$-weight distribution of MDS codes using solutions to equations and properties of shortened codes, broadening prior work.
Findings
Derived the $b$-weight distribution for MDS codes.
Connected $b$-weight distribution to the structure of shortened codes.
Generalized previous results by Ma and Luo.
Abstract
For a positive integer , the -symbol code is a new coding framework proposed to combat -errors in -symbol read channels. Especially, the -symbol code is called a symbol-pair code. Remarkably, a classical maximum distance separable (MDS) code is also an MDS -symbol code. Recently, for any MDS code , Ma and Luo determined the symbol-pair weight distribution of . In this paper, by calculating the number of solutions for some equations and utilizing some shortened codes of , we give the connection between the -weight distribution and the number of codewords in shortened codes of with special shape. Furthermore, note that shortened codes of are also MDS codes, the number of these codewords with special shape are also determined by the shorten method. From the above calculation, the -weight…
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
TopicsCoding theory and cryptography · graph theory and CDMA systems · Error Correcting Code Techniques
