Code optimisation for finite error rate

A. G. Burr*, T. J. Lunn

*Corresponding author for this work

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

Abstract

We present a new construction based on Blokh and Zyablov's generalised concatenated codes for codes and coded modulation schemes with coding gain optimised for a given decoded word error rate, rather than for asymptotic coding gain. It is shown that this may be achieved by a geometric structure for the codes in which not all neighbouring codewords are at equal distances, which implies also that the minimum distance of the code is no longer maximised. The technique may be applied to coded modulation schemes where the 'inner code' is a multilevel signalling constellation, or to concatenated binary codes or codes over GF(q). The outer code may be a block or a trellis code. The technique is illustrated with reference to a block coded modulation scheme, block coded 8-PSK.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages67
Number of pages1
ISBN (Print)0780308786
Publication statusPublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Cite this