Graph based linear error correcting codes

MaRDI QIDQ5283075zbMATH OpenFDO

Authors Monika Polak, Eustrat Zhupa

Publication date 18 July 2017

Full work available at URL https://arxiv.org/abs/1612.03279, http://albanian-j-math.com/archives/2016-04.pdf

zbMATH Keywords

LDPC codessparse graphgraph based algorithmquality of transmission

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear codes (general theory) (94B05)

Abstract: In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDPC codes are in the classical Hamming metric. They are very close to well known Shannon bound. The ability to use graphs for code construction was first discussed by Tanner in 1981 and has been used in a number of very effective implementations. We describe how to construct such codes by using special a family of graphs introduced by Ustimenko and Woldar. Graphs that we used are bipartite, bi-regular, very sparse and do not have short cycles C 4 . Due to the very low density of such graphs, the obtained codes are fast decodable. We describe how to choose parameters to obtain a desired code rate. We also show results of computer simulations of BER (bit error rate) of the obtained codes in order to compare them with other known LDPC codes.

Recommendations

• Error-correcting codes from graphs
• LDPC codes based on algebraic graphs
• scientific article; zbMATH DE number 1775410
• Improved low-density parity-check codes using irregular graphs
• Sparse codes derived from graphs

Cited in

(11)

• Linear codes over signed graphs
• Error-correcting codes from graphs
• Explicit Construction of Families of LDPC Codes With No<tex>$4$</tex>-Cycles
• The weighted moduli space of binary sextics
• Graph-Based Decoding in the Presence of ISI
• On the discriminant of certain quadrinomials
• Graph-based convolutional and block LDPC codes
• scientific article; zbMATH DE number 5953464 (Why is no real title available?)
• On hyperelliptic curves of genus 3
• Some combinatorial aspects of constructing bipartite-graph codes
• LDPC codes based on algebraic graphs

This page was built for publication: Graph based linear error correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283075)