Publication:4242014
zbMath0929.94028MaRDI QIDQ4242014
Publication date: 1 February 2000
linear codes; decoding; coding theory; minimum distance; Gilbert-Varshamov bound; complexity of algorithms; weight spectrum; soft decision decoding; information set decoding; asymptotically good codes; asymptotic behaviour of algorithms; computation of important numerical parameters; construction of block codes; covering set decoding; gradient-like decoding; hard decision decoding; list cascade decoding; minimal vectors ML decoding; punctured split syndrom decoding; split syndrom decoding; syndrom trellis decoding; weighted partitions decoding
68Q25: Analysis of algorithms and problem complexity
94B05: Linear codes (general theory)
94B35: Decoding
92-02: Research exposition (monographs, survey articles) pertaining to biology
Related Items