Abstract
Using only the principle of inclusion and exclusion, the author derives a formula for the weight distribution of an (n,k) code whose dual code has a minimum distance d'>or=k. The result yields a new condition on the weight distributions of a linear code and its dual which is necessary and sufficient for the code to be a maximum distance separable (MDS) code. Moreover, it shows how the weight distribution for linear MDS codes is obtained in an elementary manner.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have