Name
Abstract | ||
|---|---|---|
Let S (N,q) be the set of all words of length N over the bipolar alphabet (-1,+1), having a qth order spectral-null at zero frequency. Any subset of S (N,q) is a spectral-null code of length N and order q. This correspondence gives an equivalent formulation of S(N,q) in terms of codes over the binary alphabet (0,1), shows that S(N,2) is equivalent to a well-known class of single-error correcting and all unidirectional-error detecting (SEC-AUED) codes, derives an explicit expression for the redundancy of S(N,2), and presents new efficient recursive design methods for second-order spectral-null codes which are less redundant than the codes found in the literature |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/18.796412 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
bipolar alphabet,sec-aued codes,zero frequency,error detection codes,efficient recursive code design methods,high-order spectral-null codes,spectral analysis,error correction codes,recursive design methods,single error correcting codes,unidirectional error detecting codes,redundancy,balanced codes,single error correcting-all unidirectional error detecting codes,code redundancy,partial response channels,second-order spectral-null codes,code length,computer simulation,design method,design methodology,binary codes,channel capacity,decoding,second order,error detection,error correction,block codes | Discrete mathematics,Combinatorics,Computer science,Block code,Binary code,Expander code,Redundancy (engineering),Linear code,Decoding methods,Channel capacity,Binary number | Journal |
Volume | Issue | ISSN |
45 | 7 | 0018-9448 |
ISBN | Citations | PageRank |
0-7803-2453-6 | 13 | 1.01 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca G. Tallini | 1 | 161 | 23.93 |
| Sulaiman Al-Bassam | 2 | 89 | 8.30 |
| Bimal K. Bose | 3 | 166 | 19.45 |