Linear code (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Linear code" in English language version.

refsWebsite

Global rank English rank

6^th place

670^th place

480^th place

18^th place

17^th place

69^th place

59^th place

3,863^rd place

2,637^th place

3^rd place

archive.org

William E. Ryan and Shu Lin (2009). Channel Codes: Classical and Modern. Cambridge University Press. p. 4. ISBN 978-0-521-84868-8.
Thomas M. Cover and Joy A. Thomas (1991). Elements of Information Theory. John Wiley & Sons, Inc. pp. 210–211. ISBN 978-0-471-06259-2.
J.H. van Lint (1999). Introduction to Coding Theory (3rd ed.). Springer. Chapter 8: Codes over ℤ₄. ISBN 978-3-540-64133-9.

Etzion, Tuvi; Raviv, Netanel (2013). "Equidistant codes in the Grassmannian". arXiv:1308.6231 [math.CO].

S.T. Dougherty; J.-L. Kim; P. Sole (2015). "Open Problems in Coding Theory". In Steven Dougherty; Alberto Facchini; Andre Gerard Leroy; Edmund Puczylowski; Patrick Sole (eds.). Noncommutative Rings and Their Applications. American Mathematical Soc. p. 80. ISBN 978-1-4704-1032-2.

MacKay, David, J.C. (2003). Information Theory, Inference, and Learning Algorithms (PDF). Cambridge University Press. p. 9. Bibcode:2003itil.book.....M. ISBN 9780521642989. In a linear block code, the extra $N-K$ bits are linear functions of the original $K$ bits; these extra bits are called parity-check bits{{cite book}}: CS1 maint: multiple names: authors list (link)

MacKay, David, J.C. (2003). Information Theory, Inference, and Learning Algorithms (PDF). Cambridge University Press. p. 9. Bibcode:2003itil.book.....M. ISBN 9780521642989. In a linear block code, the extra $N-K$ bits are linear functions of the original $K$ bits; these extra bits are called parity-check bits{{cite book}}: CS1 maint: multiple names: authors list (link)