Coding scheme for a wire-tap channel using regular codes (Q1068785)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Coding scheme for a wire-tap channel using regular codes |
scientific article; zbMATH DE number 3930885
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coding scheme for a wire-tap channel using regular codes |
scientific article; zbMATH DE number 3930885 |
Statements
Coding scheme for a wire-tap channel using regular codes (English)
0 references
1985
0 references
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.
0 references
Hamming codes
0 references
Coset-coding
0 references
weight enumerator
0 references
BCH codes
0 references