What people are saying - Write a review
We haven't found any reviews in the usual places.
Information Theory in Random Fields
Linear Complexity in Coding Theory
CODING AND COMBINATORICS
2 other sections not shown
Other editions - View all
algebraic array associated autocorrelation Battail binary cardinality channel system class of codes codeword coding theory coefficients columns Compute concatenated configuration consider construction convolutional codes corresponding curve cyclic code decoding algorithms defined denote depth divisor element encoder equal equation equivalent erasure Error-Correcting Codes feasible code finite geometric codes given GNAF Goppa codes graph HDCD Heraltlan IEEE Trans input patterns integer irreducible classes k-permutation L-optimal Lemma linear codes linear complexity lower bound Markov random field Math matrix metric minimum distance modular weights modulo N-tuples non-zero NP-complete o o o obtained output parameters perfect codes periodic sequence permutation polynomial prefix code probability distribution Proof random field rational points redundant algorithm Reed-Muller codes right leaning tree rows runs of length satisfy signal singular soft decision decoding strongly regular graph symbols terminal nodes Theorem Theory triangular inequality upper bounds vector zero