Codes and graphs

被引：0
|
作者：
Shokrollahi, MA [1 ]
机构：
[1] Bell Labs, Murray Hill, NJ 07974 USA
来源：
STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE | 2000年 / 1770卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, I will give a brief introduction to the theory of low-density parity-check codes, and their decoding. I will emphasize the case of correcting erasures as it is still the best understood and most accessible case. At the end of the paper, I will also describe more recent developments.
引用
收藏
页码：1 / 12
页数：12
相关论文
共 50 条
  • [31] Codes on graphs: Normal realizations
    Forney, GD
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) : 520 - 548
  • [32] Cyclotomic graphs and perfect codes
    Zhou, Sanming
    [J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 2019, 223 (03) : 931 - 947
  • [33] Perfect codes in circulant graphs
    Feng, Rongquan
    Huang, He
    Zhou, Sanming
    [J]. DISCRETE MATHEMATICS, 2017, 340 (07) : 1522 - 1527
  • [34] Strong identification codes for graphs
    Ganesan, Ghurumuruhan
    [J]. DISCRETE MATHEMATICS, 2021, 344 (09)
  • [35] ELUSIVE CODES IN HAMMING GRAPHS
    Hawtin, Daniel R.
    Gillespie, Neil I.
    Praeger, Cheryl E.
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2013, 88 (02) : 286 - 296
  • [36] Codes on graphs: Normal realizations
    Forney, GD
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 9 - 9
  • [37] Authentication codes and bipartite graphs
    Feng, Rongquan
    Hu, Lei
    Kwak, Jin Ho
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (06) : 1473 - 1482
  • [38] PERFECT CODES IN GENERAL GRAPHS
    KRATOCHVIL, J
    [J]. COMBINATORICS /, 1988, 52 : 357 - 364
  • [39] Codes and designs from triangular graphs and their line graphs
    Fish, Washiela
    Kumwenda, Khumbo
    Mwambene, Eric
    [J]. CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2011, 9 (06): : 1411 - 1423
  • [40] Perfect codes in Doob graphs
    Krotov, Denis S.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (01) : 91 - 102
12345