On separability of some known nonlinear block codes

Sidorenko, V. and Martin, Ian and Honary, Bahram (1997) On separability of some known nonlinear block codes. In: Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on. IEEE, Ulm, Germany, p. 506. ISBN 0-7803-3956-8

Full text not available from this repository.

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 C 9 is not separable, but can be made separable by an appropriate permutation.

Item Type: Contribution in Book/Report/Proceedings
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 61199
Deposited By: ep_importer_pure
Deposited On: 06 Feb 2013 18:24
Refereed?: Yes
Published?: Published
Last Modified: 30 Sep 2019 11:21
URI: https://eprints.lancs.ac.uk/id/eprint/61199

Actions (login required)

View Item View Item