Lattice low-density parity check codes and their application in partial response systems

Bane V Vasic, Alexander Kuznetsov, Erozan Kurtas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

This paper introduces a combinatorial construction of high rate low-density parity check codes based on two-dimensional integer lattices. A class of codes with a wide range of lengths, column weights and minimum distances is obtained. The resulting codes are doubly circulant, i.e. the matrix of parity checks is an array of circulant matrices. The bounds on the minimum distance are established and the performance of these codes in partial response channels is investigated.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages453
Number of pages1
StatePublished - 2002
Event2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland
Duration: Jun 30 2002Jul 5 2002

Other

Other2002 IEEE International Symposium on Information Theory
CountrySwitzerland
CityLausanne
Period6/30/027/5/02

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Vasic, B. V., Kuznetsov, A., & Kurtas, E. (2002). Lattice low-density parity check codes and their application in partial response systems. In IEEE International Symposium on Information Theory - Proceedings (pp. 453)

Lattice low-density parity check codes and their application in partial response systems. / Vasic, Bane V; Kuznetsov, Alexander; Kurtas, Erozan.

IEEE International Symposium on Information Theory - Proceedings. 2002. p. 453.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Vasic, BV, Kuznetsov, A & Kurtas, E 2002, Lattice low-density parity check codes and their application in partial response systems. in IEEE International Symposium on Information Theory - Proceedings. pp. 453, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, 6/30/02.
Vasic BV, Kuznetsov A, Kurtas E. Lattice low-density parity check codes and their application in partial response systems. In IEEE International Symposium on Information Theory - Proceedings. 2002. p. 453
Vasic, Bane V ; Kuznetsov, Alexander ; Kurtas, Erozan. / Lattice low-density parity check codes and their application in partial response systems. IEEE International Symposium on Information Theory - Proceedings. 2002. pp. 453
@inproceedings{3f5b4b0ec4b04c8bbb9fa710b74da148,
title = "Lattice low-density parity check codes and their application in partial response systems",
abstract = "This paper introduces a combinatorial construction of high rate low-density parity check codes based on two-dimensional integer lattices. A class of codes with a wide range of lengths, column weights and minimum distances is obtained. The resulting codes are doubly circulant, i.e. the matrix of parity checks is an array of circulant matrices. The bounds on the minimum distance are established and the performance of these codes in partial response channels is investigated.",
author = "Vasic, {Bane V} and Alexander Kuznetsov and Erozan Kurtas",
year = "2002",
language = "English (US)",
pages = "453",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Lattice low-density parity check codes and their application in partial response systems

AU - Vasic, Bane V

AU - Kuznetsov, Alexander

AU - Kurtas, Erozan

PY - 2002

Y1 - 2002

N2 - This paper introduces a combinatorial construction of high rate low-density parity check codes based on two-dimensional integer lattices. A class of codes with a wide range of lengths, column weights and minimum distances is obtained. The resulting codes are doubly circulant, i.e. the matrix of parity checks is an array of circulant matrices. The bounds on the minimum distance are established and the performance of these codes in partial response channels is investigated.

AB - This paper introduces a combinatorial construction of high rate low-density parity check codes based on two-dimensional integer lattices. A class of codes with a wide range of lengths, column weights and minimum distances is obtained. The resulting codes are doubly circulant, i.e. the matrix of parity checks is an array of circulant matrices. The bounds on the minimum distance are established and the performance of these codes in partial response channels is investigated.

UR - http://www.scopus.com/inward/record.url?scp=0036350163&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036350163&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036350163

SP - 453

BT - IEEE International Symposium on Information Theory - Proceedings

ER -