On codes designed via algebraic lifts of graphs

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

5 Citations (Scopus)

Abstract

Over the past few years several constructions of protograph 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. The strength of the voltage graph framework is the ability to analyze the resulting derived graph algebraically, even when the voltages themselves are assigned randomly. Moreover, the theory of voltage graphs provides insight to designing lifts of graphs with particular properties. In this paper we illustrate how the properties of the derived graphs and the corresponding codes relate to the voltage assignments. In particular, we present a construction of LDPC codes by giving an algebraic method of choosing the permutation voltages and illustrate the usefulness of the proposed technique via simulation results.

Original languageEnglish (US)
Title of host publication46th Annual Allerton Conference on Communication, Control, and Computing
Pages1254-1261
Number of pages8
DOIs
StatePublished - Dec 1 2008
Event46th Annual Allerton Conference on Communication, Control, and Computing - Monticello, IL, United States
Duration: Sep 24 2008Sep 26 2008

Publication series

Name46th Annual Allerton Conference on Communication, Control, and Computing

Other

Other46th Annual Allerton Conference on Communication, Control, and Computing
CountryUnited States
CityMonticello, IL
Period9/24/089/26/08

Fingerprint

Electric potential
simulation
ability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Control and Systems Engineering
  • Communication

Cite this

Kelley, C. A. (2008). On codes designed via algebraic lifts of graphs. In 46th Annual Allerton Conference on Communication, Control, and Computing (pp. 1254-1261). [4797704] (46th Annual Allerton Conference on Communication, Control, and Computing). https://doi.org/10.1109/ALLERTON.2008.4797704

On codes designed via algebraic lifts of graphs. / Kelley, Christine A.

46th Annual Allerton Conference on Communication, Control, and Computing. 2008. p. 1254-1261 4797704 (46th Annual Allerton Conference on Communication, Control, and Computing).

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

Kelley, CA 2008, On codes designed via algebraic lifts of graphs. in 46th Annual Allerton Conference on Communication, Control, and Computing., 4797704, 46th Annual Allerton Conference on Communication, Control, and Computing, pp. 1254-1261, 46th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, United States, 9/24/08. https://doi.org/10.1109/ALLERTON.2008.4797704
Kelley CA. On codes designed via algebraic lifts of graphs. In 46th Annual Allerton Conference on Communication, Control, and Computing. 2008. p. 1254-1261. 4797704. (46th Annual Allerton Conference on Communication, Control, and Computing). https://doi.org/10.1109/ALLERTON.2008.4797704
Kelley, Christine A. / On codes designed via algebraic lifts of graphs. 46th Annual Allerton Conference on Communication, Control, and Computing. 2008. pp. 1254-1261 (46th Annual Allerton Conference on Communication, Control, and Computing).
@inproceedings{c1f78e596c6849bfb7ba3aebda15d2f0,
title = "On codes designed via algebraic lifts of graphs",
abstract = "Over the past few years several constructions of protograph 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. The strength of the voltage graph framework is the ability to analyze the resulting derived graph algebraically, even when the voltages themselves are assigned randomly. Moreover, the theory of voltage graphs provides insight to designing lifts of graphs with particular properties. In this paper we illustrate how the properties of the derived graphs and the corresponding codes relate to the voltage assignments. In particular, we present a construction of LDPC codes by giving an algebraic method of choosing the permutation voltages and illustrate the usefulness of the proposed technique via simulation results.",
author = "Kelley, {Christine A.}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ALLERTON.2008.4797704",
language = "English (US)",
isbn = "9781424429264",
series = "46th Annual Allerton Conference on Communication, Control, and Computing",
pages = "1254--1261",
booktitle = "46th Annual Allerton Conference on Communication, Control, and Computing",

}

TY - GEN

T1 - On codes designed via algebraic lifts of graphs

AU - Kelley, Christine A.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Over the past few years several constructions of protograph 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. The strength of the voltage graph framework is the ability to analyze the resulting derived graph algebraically, even when the voltages themselves are assigned randomly. Moreover, the theory of voltage graphs provides insight to designing lifts of graphs with particular properties. In this paper we illustrate how the properties of the derived graphs and the corresponding codes relate to the voltage assignments. In particular, we present a construction of LDPC codes by giving an algebraic method of choosing the permutation voltages and illustrate the usefulness of the proposed technique via simulation results.

AB - Over the past few years several constructions of protograph 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. The strength of the voltage graph framework is the ability to analyze the resulting derived graph algebraically, even when the voltages themselves are assigned randomly. Moreover, the theory of voltage graphs provides insight to designing lifts of graphs with particular properties. In this paper we illustrate how the properties of the derived graphs and the corresponding codes relate to the voltage assignments. In particular, we present a construction of LDPC codes by giving an algebraic method of choosing the permutation voltages and illustrate the usefulness of the proposed technique via simulation results.

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

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

U2 - 10.1109/ALLERTON.2008.4797704

DO - 10.1109/ALLERTON.2008.4797704

M3 - Conference contribution

AN - SCOPUS:64549150629

SN - 9781424429264

T3 - 46th Annual Allerton Conference on Communication, Control, and Computing

SP - 1254

EP - 1261

BT - 46th Annual Allerton Conference on Communication, Control, and Computing

ER -