LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes

Photo by rainierridao from unsplash

Determining the maximal length of MDS codes with certain dimension has been an interesting research topic in coding theory. The objective of this paper is to derive an upper bound… Click to show full abstract

Determining the maximal length of MDS codes with certain dimension has been an interesting research topic in coding theory. The objective of this paper is to derive an upper bound for the maximal length of MDS elliptic codes over $\mathbb {F}_{q}$ with dimension $3\leq k\leq \frac {q+1-2\sqrt {q}}{10}$ . For such a range of dimension $k$ , our result improves an earlier bound of Munuera and gives an affirmative solution to the conjecture of Li, Wan, and Zhang. Most notably, the proposed upper bound is tight for odd $k$ in the sense that it can be achieved by some well-designed MDS elliptic codes.

Keywords: length mds; inline formula; maximal length; tex math

Journal Title: IEEE Transactions on Information Theory
Year Published: 2023

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.