Edge Transitive Ramanujan Graphs and Symmetric LDPC Good Codes

被引:0
|
作者
Kaufman, Tali [1 ]
Lubotzky, Alexander [2 ]
机构
[1] Bar Ilan Univ, Ramat Gan, Israel
[2] Hebrew Univ Jerusalem, Jerusalem, Israel
基金
以色列科学基金会;
关键词
Error correcting codes; LDPC codes; Ramanujan graphs; EXPLICIT CONSTRUCTIONS; COMPLEXES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present the first explicit construction of a binary symmetric code with constant rate and constant distance (i.e., good code). Moreover, the code is LDPC and its constraint space is generated by the orbit of one constant weight constraint under the group action. In particular, it solves the main open problem raised by Kaufman and Wigderson in [8].
引用
收藏
页码:359 / 365
页数:7
相关论文
共 50 条
  • [1] Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
    Al-Hamdani, Hussein
    Almamori, Aqiel
    Mohan, Seshadri
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2022, 125 (03) : 2463 - 2475
  • [2] Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
    Hussein Al-Hamdani
    Aqiel Almamori
    Seshadri Mohan
    [J]. Wireless Personal Communications, 2022, 125 : 2463 - 2475
  • [3] LDPC codes constructed from cubic symmetric graphs
    Dean Crnković
    Sanja Rukavina
    Marina Šimac
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2022, 33 : 505 - 522
  • [4] LDPC codes constructed from cubic symmetric graphs
    Crnkovic, Dean
    Rukavina, Sanja
    Simac, Marina
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2022, 33 (05) : 505 - 522
  • [5] Symmetric unique neighbor expanders and good LDPC codes
    Becker, Oren
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 211 : 211 - 216
  • [6] COMPLETELY TRANSITIVE CODES AND DISTANCE TRANSITIVE GRAPHS
    RIFA, J
    PUJOL, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 360 - 367
  • [7] On products of graphs for LDPC codes
    Xu, J
    Lin, S
    Blake, IF
    [J]. 2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2003, : 6 - 9
  • [8] Families of completely transitive codes and distance transitive graphs
    Borges, J.
    Rifa, J.
    Zinoviev, V. A.
    [J]. DISCRETE MATHEMATICS, 2014, 324 : 68 - 71
  • [9] Deriving Good LDPC Convolutional Codes from LDPC Block Codes
    Pusane, Ali E.
    Smarandache, Roxana
    Vontobel, Pascal O.
    Costello, Daniel J., Jr.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 835 - 857
  • [10] Completely transitive codes in hamming graphs
    Giudici, M
    Praeger, CE
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (07) : 647 - 661