Publication: LDPC codes from matrix equations
LDPC codes from matrix equations
Date
Date
Date
Citations
Amir, A., Michell, A., & Rosenthal, J. (2010). LDPC codes from matrix equations. In A. Edelmayer (Ed.), Proceedings of the 19th international symposium on mathematical theory of networks and systems (No. 19; Issue 19, pp. 301–305). MTNS.
Abstract
Abstract
Abstract
Different constructions of LDPC codes based on matrix equations are investigated. The parameters such as the dimension, rate and distance are computed. The classical Tanner graph representation known for LDPC codes are described. The main difference between standard LDPC codes and the LDPC codes based on matrix equations lies in the structure of their codewords. Whereas in the classical situation codewords are simply vectors, the codewords in this new setting will be two-dimensional vectors or matrices. This implies that the parity-ch
Metrics
Views
Citations
Additional indexing
Creators (Authors)
Event Title
Event Title
Event Title
Event Location
Event Location
Event Location
Event Country
Event Country
Event Country
Event Start Date
Event Start Date
Event Start Date
Event End Date
Event End Date
Event End Date
Publisher
Publisher
Publisher
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Date available
Date available
Date available
Series Name
Series Name
Series Name
Number
Number
Number
ISBN or e-ISBN
ISBN or e-ISBN
ISBN or e-ISBN
OA Status
OA Status
OA Status
Metrics
Views
Citations
Citations
Amir, A., Michell, A., & Rosenthal, J. (2010). LDPC codes from matrix equations. In A. Edelmayer (Ed.), Proceedings of the 19th international symposium on mathematical theory of networks and systems (No. 19; Issue 19, pp. 301–305). MTNS.
