✦ LIBER ✦

Single-Exclusion Number and the Stopping Redundancy of MDS Codes

✍ Scribed by Junsheng Han; Siegel, P.H.; Roth, R.M.

Book ID: 114641793
Publisher: IEEE
Year: 2009
Tongue: English
Weight: 421 KB
Volume: 55
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2025578

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the stopping distance and the stoppin

On the stopping distance and the stopping redundancy of codes

✍ Schwartz, M.; Vardy, A. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 396 KB

Permutation Decoding and the Stopping Re

Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

✍ Hehn, T.; Milenkovic, O.; Laendner, S.; Huber, J.B. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 751 KB

Hyperplane Sections of Grassmannians and

Hyperplane Sections of Grassmannians and the Number of MDS Linear Codes

✍ Sudhir R. Ghorpade; Gilles Lachaud 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 474 KB

We obtain some e!ective lower and upper bounds for the number of (n, k)-MDS linear codes over % O . As a consequence, one obtains an asymptotic formula for this number. These results also apply for the number of inequivalent representations over % O of the uniform matroid or, alternatively, the numb

On the Number of Minimum Stopping Sets a

On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes

✍ Haiyang Liu; Lianrong Ma; Jie Chen 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 161 KB

[IEEE 2008 9th International Conference

[IEEE 2008 9th International Conference on Signal Processing (ICSP 2008) - Beijing, China (2008.10.26-2008.10.29)] 2008 9th International Conference on Signal Processing - A new algorithm of counting the number of small stopping sets and girth in QC-LDPC Codes

✍ Lingjun Kong, ; Yang Xiao, 📂 Article 📅 2008 🏛 IEEE ⚖ 133 KB