Algebraic constructions of graph-based nested codes from protographs

Christine A. Kelley, Jörg Kliewer

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

10 Citations (Scopus)

Abstract

Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages829-833
Number of pages5
DOIs
StatePublished - Aug 23 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period6/13/106/18/10

Fingerprint

Graph in graph theory
Channel Coding
Network Coding
Channel coding
Network coding
Binning
LDPC Codes
Linear Codes
Communication
Superposition
Electric potential
Voltage
Analogue

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Kelley, C. A., & Kliewer, J. (2010). Algebraic constructions of graph-based nested codes from protographs. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 829-833). [5513628] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513628

Algebraic constructions of graph-based nested codes from protographs. / Kelley, Christine A.; Kliewer, Jörg.

2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 829-833 5513628 (IEEE International Symposium on Information Theory - Proceedings).

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

Kelley, CA & Kliewer, J 2010, Algebraic constructions of graph-based nested codes from protographs. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513628, IEEE International Symposium on Information Theory - Proceedings, pp. 829-833, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 6/13/10. https://doi.org/10.1109/ISIT.2010.5513628
Kelley CA, Kliewer J. Algebraic constructions of graph-based nested codes from protographs. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 829-833. 5513628. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513628
Kelley, Christine A. ; Kliewer, Jörg. / Algebraic constructions of graph-based nested codes from protographs. 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. pp. 829-833 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{b6172fc6c6524b31b324054103c36f18,
title = "Algebraic constructions of graph-based nested codes from protographs",
abstract = "Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.",
author = "Kelley, {Christine A.} and J{\"o}rg Kliewer",
year = "2010",
month = "8",
day = "23",
doi = "10.1109/ISIT.2010.5513628",
language = "English (US)",
isbn = "9781424469604",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "829--833",
booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

}

TY - GEN

T1 - Algebraic constructions of graph-based nested codes from protographs

AU - Kelley, Christine A.

AU - Kliewer, Jörg

PY - 2010/8/23

Y1 - 2010/8/23

N2 - Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.

AB - Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in physical-layer secrecy. Whereas nested lattice codes have been proposed recently for continuous-input channels, in this paper we focus on the construction of nested linear codes for joint channel-network coding problems based on algebraic protograph LDPC codes. In particular, over the past few years several constructions of codes have been proposed that are based on random lifts of suitably chosen base graphs. More recently, an algebraic analog of this approach was introduced using the theory of voltage graphs. In this paper we illustrate how these methods can be used in the construction of nested codes from algebraic lifts of graphs.

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

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

U2 - 10.1109/ISIT.2010.5513628

DO - 10.1109/ISIT.2010.5513628

M3 - Conference contribution

AN - SCOPUS:77955701722

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 829

EP - 833

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

ER -