On the error-correcting capabilities of cycle codes of graphs

Laurent Decreusefond; Gilles Zemor

On the error-correcting capabilities of cycle codes of graphs

Laurent Decreusefond
, Gilles Zemor

Telecom Paris

Research output: Contribution to conference › Paper › peer-review

Abstract

The objective of this work is to study the error-correcting potential of cycle codes for the binary symmetric channel. This will be done to determine the highest channel error probability the cycle codes can sustain while achieving vanishing error probability after decoding for the case of a given information rate R.

Original language	English
Publication status	Published - 1 Dec 1994
Event	Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 27 Jun 1994 → 1 Jul 1994

Conference

Conference	Proceedings of the 1994 IEEE International Symposium on Information Theory
City	Trodheim, Norw
Period	27/06/94 → 1/07/94

Cite this

@conference{5f7d672f899d49adab96da092ca2a908,

title = "On the error-correcting capabilities of cycle codes of graphs",

abstract = "The objective of this work is to study the error-correcting potential of cycle codes for the binary symmetric channel. This will be done to determine the highest channel error probability the cycle codes can sustain while achieving vanishing error probability after decoding for the case of a given information rate R.",

author = "Laurent Decreusefond and Gilles Zemor",

year = "1994",

month = dec,

day = "1",

language = "English",

note = "Proceedings of the 1994 IEEE International Symposium on Information Theory ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - CONF

T1 - On the error-correcting capabilities of cycle codes of graphs

AU - Decreusefond, Laurent

AU - Zemor, Gilles

PY - 1994/12/1

Y1 - 1994/12/1

N2 - The objective of this work is to study the error-correcting potential of cycle codes for the binary symmetric channel. This will be done to determine the highest channel error probability the cycle codes can sustain while achieving vanishing error probability after decoding for the case of a given information rate R.

AB - The objective of this work is to study the error-correcting potential of cycle codes for the binary symmetric channel. This will be done to determine the highest channel error probability the cycle codes can sustain while achieving vanishing error probability after decoding for the case of a given information rate R.

UR - https://www.scopus.com/pages/publications/0028706684

M3 - Paper

AN - SCOPUS:0028706684

T2 - Proceedings of the 1994 IEEE International Symposium on Information Theory

Y2 - 27 June 1994 through 1 July 1994

ER -

On the error-correcting capabilities of cycle codes of graphs

Abstract

Conference

Other files and links

Fingerprint

Cite this