Home > Research > Publications & Outputs > On the rectangularity of nonlinear block codes

Research

Links

Text available via DOI:

View graph of relations

On the rectangularity of nonlinear block codes

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

On the rectangularity of nonlinear block codes. / Sidorenko, V.; Martin, Ian; Honary, Bahram.
In: IEEE Transactions on Information Theory, Vol. 45, No. 2, 03.1999, p. 720-725.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Sidorenko, V, Martin, I & Honary, B 1999, 'On the rectangularity of nonlinear block codes', IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 720-725. https://doi.org/10.1109/18.749021

APA

Sidorenko, V., Martin, I., & Honary, B. (1999). On the rectangularity of nonlinear block codes. IEEE Transactions on Information Theory, 45(2), 720-725. https://doi.org/10.1109/18.749021

Vancouver

Sidorenko V, Martin I, Honary B. On the rectangularity of nonlinear block codes. IEEE Transactions on Information Theory. 1999 Mar;45(2):720-725. doi: 10.1109/18.749021

Author

Sidorenko, V. ; Martin, Ian ; Honary, Bahram. / On the rectangularity of nonlinear block codes. In: IEEE Transactions on Information Theory. 1999 ; Vol. 45, No. 2. pp. 720-725.

Bibtex

@article{97b5b658db6f4180a0e45f3b532f9ac3,
title = "On the rectangularity of nonlinear block codes",
abstract = "We give simple sufficient conditions for a code to be rectangular and show that large families of well-known nonlinear codes are rectangular. These include Hadamard (1893), Levenshtein (1964), Delsarte-Goethals (1975), Kerdock (1972), and Nordstrom-Robinson (1967) codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding.",
author = "V. Sidorenko and Ian Martin and Bahram Honary",
year = "1999",
month = mar,
doi = "10.1109/18.749021",
language = "English",
volume = "45",
pages = "720--725",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

RIS

TY - JOUR

T1 - On the rectangularity of nonlinear block codes

AU - Sidorenko, V.

AU - Martin, Ian

AU - Honary, Bahram

PY - 1999/3

Y1 - 1999/3

N2 - We give simple sufficient conditions for a code to be rectangular and show that large families of well-known nonlinear codes are rectangular. These include Hadamard (1893), Levenshtein (1964), Delsarte-Goethals (1975), Kerdock (1972), and Nordstrom-Robinson (1967) codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding.

AB - We give simple sufficient conditions for a code to be rectangular and show that large families of well-known nonlinear codes are rectangular. These include Hadamard (1893), Levenshtein (1964), Delsarte-Goethals (1975), Kerdock (1972), and Nordstrom-Robinson (1967) codes. Being rectangular, each of these codes has a unique minimal trellis that can be used for soft-decision maximum-likelihood decoding.

U2 - 10.1109/18.749021

DO - 10.1109/18.749021

M3 - Journal article

VL - 45

SP - 720

EP - 725

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -