On the Gilbert-Varshamov distance of abelian group codes

Giacomo Como, Fabio Fagnani

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

The problem of the minimum Bhattacharyya distance of group codes over symmetric channels is addressed. Ensembles of ℤm-linear codes are introduced and their typical minimum distance characterized in terms of the Gilbert-Varshamov distances associated to the subgroups of ℤm. For the AWGN channel with 8-PSK as input it is shown that the typical ℤ8 -linear code achieves the Gilbert-Varshamov bound.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages2651-2655
Number of pages5
DOIs
Publication statusPublished - 2007 Dec 1
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 2007 Jun 242007 Jun 29

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period2007/06/242007/06/29

Subject classification (UKÄ)

  • Control Engineering

Fingerprint

Dive into the research topics of 'On the Gilbert-Varshamov distance of abelian group codes'. Together they form a unique fingerprint.

Cite this