𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Error correcting codes associated with complex Hadamard matrices

✍ Scribed by I. Heng; C.H. Cooke

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
252 KB
Volume
11
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

For primes p > 2, the generalized Hadamaxd matrix H(p, pt) can be expressed as H = x A, where the notation means hij = x a~ . It is shown that the row vectors of A represent a p-ary error correcting code. Depending upon the value of t, either linear or nonlinear codes emerge. Code words are equidistant and have minimum Hamming distance d = (p -1)t. The code can be extended so as to possess N = p2t code words of length pt -1. (~) 1998 Elsevier Science Ltd. All rights reserved.

πŸ“œ SIMILAR VOLUMES

Dominated error correcting codes with di
Dominated error correcting codes with distance two
✍ FeliΓΊ Sagols; Laura P. Riccio; Charles J. Colbourn πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length __n__, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector __dominates__ the other, if and on

Codes with multi-level error-correcting
Codes with multi-level error-correcting capabilities
✍ Mao-Chao Lin; Shu Lin πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 964 KB

## In conventional channel coding, all the information symbols of a message are regarded equally significant, and hence codes are devised to provide equal protection for each information symbol against channel errors. However, in some circumstances, some information symbols in a message are more s

Error-correcting nonadaptive group testi
Error-correcting nonadaptive group testing with de-disjunct matrices
✍ Anthony J. Macula πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 407 KB

d-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and binary d-superimposed codes. The rows of a d-disjunct matrix represent the tests in a NGT algorithm which identifies up to d defects in a population. The columns of a d-disjunct matrix represent binary d-superi