On separability of some known nonlinear block codes

Vladimir Sidorenko, Ian Martin, Bahram Honary

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

A code C is separable if it has a biproper trellis presentation. This trellis simultaneously minimizes the vertex count, the edge count, the cycle rank, and the overall Viterbi decoding complexity. All group codes (including linear codes) are separable. We investigate the separability of nonlinear codes. We give sufficient conditions for a code to be separable and show that some known nonlinear codes are separable. These include Hadamard, Levenshtein, Delsarte-Goethals, Kerdock, and Nordstrom-Robinson codes. All these codes remain separable after every symbol reordering. We show that a conference matrix code C9 is not separable, but can be made separable by an appropriate permutation.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages506
Number of pages1
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Publication series

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

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97

Fingerprint

Dive into the research topics of 'On separability of some known nonlinear block codes'. Together they form a unique fingerprint.

Cite this