Coding scheme for a wire-tap channel using regular codes

From MaRDI portal

DOI10.1016/0012-365X(85)90026-3MaRDI QIDQ1068785zbMATH OpenFDO

Authors Llorenç Huguet

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(85)90026-3


zbMATH Keywords

BCH codesCoset-codingHamming codesweight enumerator

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)




Review text

Coset-coding was suggested by J. M. Goethals and L. Huguet as a coding scheme for the purpose of confusing a wire-tapper. This scheme is based on the decomposition \(C/C_ 0=\{C(0),...,C(i),...,C(M-1)\}\) of a binary code C with respect to a proper subcode \(C_ 0\), where each vector in the same coset C(i) conveys the same information. \textit{P. Delsarte's} decoding function [IEEE Trans. Inf. Theory IT-24, 70- 75 (1978; Zbl 0369.94010)], which decodes the received vector as the vector maximizing a so-called decision function \(\Delta\), obtained by partial syndromes, is easily computed from the weight enumerator of \(C_ 0^{\perp}\), when it is a regular code. Some examples are presented concerning the Hamming and 2-error correcting BCH codes, which are completely regular.


Recommendations


Cites work


Cited in
(1)








This page was built for publication: Coding scheme for a wire-tap channel using regular codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068785)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Coding_scheme_for_a_wire-tap_channel_using_regular_codes&oldid=66076566"
Powered by MediaWiki