Header

UZH-Logo

Maintenance Infos

LDPC codes from matrix equations


Amir, A; Michell, A; Rosenthal, J (2010). LDPC codes from matrix equations. In: 19th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2010 , Budapest, HU, 5 July 2010 - 9 July 2010, 301-305.

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-check constraints must be satisfied in both perpendicular
directions of the codeword. Therefore, a codeword may be
interpreted as a two-dimensional array which is suitable for
recording on two-dimensional pattern-oriented storage media

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-check constraints must be satisfied in both perpendicular
directions of the codeword. Therefore, a codeword may be
interpreted as a two-dimensional array which is suitable for
recording on two-dimensional pattern-oriented storage media

Statistics

Altmetrics

Downloads

9 downloads since deposited on 07 Feb 2011
2 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Paper), refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Event End Date:9 July 2010
Deposited On:07 Feb 2011 10:00
Last Modified:05 Apr 2016 14:43
Publisher:MTNS
Series Name:Proceedings of the ... International Symposium on Mathematical Theory of Networks and Systems
Number:19
ISBN:978-963-311-370-7
Related URLs:http://www.conferences.hu/mtns2010/ (Organisation)

Download

Preview Icon on Download
Filetype: PDF (Verlags-PDF) - Registered users only
Size: 237kB

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations