Coding scheme for a wire-tap channel using regular codes
โ Scribed by Ll. Huguet
- Book ID
- 103060254
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 508 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Coset-coding was suggested by Goethals and Huguet [3] as a coding scheme for the purpose of confusing a wire-tapper. This scheme is based on the decomposition C/C,= {C(O), , C(i), . , C(M-l)} of a binary code C with respect to a proper subcode C,, where each vector in the same coset C(i) conveys the same information. Delsarts' decoding function [ 11, which decodes the received vector as the vector maximizing a so-called decision function A, obtained by partial syndromes, is easily computed from the weight enumerator of C,l, when it is a regular code. Some examples are presented concerning the Hamming and 2-error correcting BCH codes, which are completely regular.
๐ SIMILAR VOLUMES
A major limitation in any high-performance digital communication system is the linearity region of the transmitting amplifier. Nonlinearities typically lead to signal clipping. Efficient communication in such conditions requires maintaining a low peak-to-average power ratio (PAR) in the transmitted
It is shown that the TCM scheme with 8-D rectangular constellation designed by Tretter [I] based on a well known method invented by Wei [2] can support an opportunistic channel which can transmit 300 bitds.