Difference-set cyclic (DSC) code[1]
Description
Cyclic LDPC code constructed deterministically from a difference set. Certain DCS codes satisfy more redundant constraints than Gallager codes and thus can outperform them [2].
Notes
See book [3; Ch. 6] for a general theory of linear codes made from difference sets.
Parents
Cousins
- Hadamard code — Hadamard difference sets are difference sets constructed from Hadamard matrices [3; Ch. 6].
- Hyperoval code — Hyperoval difference sets yield DSC codes [4][3; Ch. 6].
- Generalized RM (GRM) code — DSC codes can be subfield subcodes of GRM codes, and visa versa [3; Thm. 6.14].
References
- [1]
- E. J. Weldon Jr., “Difference-Set Cyclic Codes”, Bell System Technical Journal 45, 1045 (1966) DOI
- [2]
- D. J. C. MacKay and M. C. Davey, “Evaluation of Gallager Codes for Short Block Length and High Rate Applications”, Codes, Systems, and Graphical Models 113 (2001) DOI
- [3]
- C. Ding, Codes from Difference Sets (WORLD SCIENTIFIC, 2014) DOI
- [4]
- A. Maschietti, Designs, Codes and Cryptography 14, 89 (1998) DOI
Page edit log
- Victor V. Albert (2023-05-04) — most recent
Cite as:
“Difference-set cyclic (DSC) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/difference_set