Home > Research > Publications & Outputs > On separability of some known nonlinear block c...

Research

Links

Text available via DOI:

View graph of relations

On separability of some known nonlinear block codes

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

On separability of some known nonlinear block codes. / Sidorenko, V.; Martin, Ian; Honary, Bahram.
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on. Ulm, Germany: IEEE, 1997. p. 506.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Sidorenko, V, Martin, I & Honary, B 1997, On separability of some known nonlinear block codes. in Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on. IEEE, Ulm, Germany, pp. 506. https://doi.org/10.1109/ISIT.1997.613443

APA

Sidorenko, V., Martin, I., & Honary, B. (1997). On separability of some known nonlinear block codes. In Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on (pp. 506). IEEE. https://doi.org/10.1109/ISIT.1997.613443

Vancouver

Sidorenko V, Martin I, Honary B. On separability of some known nonlinear block codes. In Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on. Ulm, Germany: IEEE. 1997. p. 506 doi: 10.1109/ISIT.1997.613443

Author

Sidorenko, V. ; Martin, Ian ; Honary, Bahram. / On separability of some known nonlinear block codes. Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on. Ulm, Germany : IEEE, 1997. pp. 506

Bibtex

@inproceedings{5b457f95ce1c4abd992bf8363ce5dcb1,
title = "On separability of some known nonlinear block codes",
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.",
author = "V. Sidorenko and Ian Martin and Bahram Honary",
year = "1997",
month = jun,
doi = "10.1109/ISIT.1997.613443",
language = "English",
isbn = "0-7803-3956-8",
pages = "506",
booktitle = "Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - On separability of some known nonlinear block codes

AU - Sidorenko, V.

AU - Martin, Ian

AU - Honary, Bahram

PY - 1997/6

Y1 - 1997/6

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.1997.613443

DO - 10.1109/ISIT.1997.613443

M3 - Conference contribution/Paper

SN - 0-7803-3956-8

SP - 506

BT - Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

PB - IEEE

CY - Ulm, Germany

ER -