Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes-Reference-Cited by-同舟云学术

Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes

Published:2016-01 Issue:1 Volume:52 Page:6-13
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Frolov A. A.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946016010026.pdf

Reference7 articles.

1. Ben-Haim, Y. and Litsyn, S., Upper Bounds on the Rate of LDPC Codes as a Function of Minimum Distance, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 5, pp. 2092–2100.

2. Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Translated under the title Kody s maloi plotnost’yu proverok na chetnost’, Moscow: Mir, 1966.

3. Tanner, R.M., A Recursive Approach to Low Complexity Codes, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 5, pp. 533–547.

4. Frolov, A.A. and Zyablov, V.V., Bounds on the Minimum Code Distance for Nonbinary Codes Based on Bipartite Graphs, Probl. Peredachi Inf., 2011, vol. 47, no. 4, pp. 27–42 [Probl. Inf. Trans. (Engl. Transl.), 2011, vol. 47, no. 4, pp. 327–341].

5. Ben-Haim, Y. and Litsyn, S., A New Upper Bound on the Rate of Non-Binary Codes, Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT’2006), Seattle, WA,USA, July 9–14, 2006, pp. 297–301.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Need for Structure in Quantum LDPC Codes;IEEE Transactions on Information Theory;2020-03