Decoding linear block codes for minimizing word error rate (Corresp.)
From MaRDI portal
Publication:3858156
DOI10.1109/TIT.1979.1056120zbMath0423.94032OpenAlexW1971461403MaRDI QIDQ3858156
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1979.1056120
complexitylinear block codesAWGN channelcorrelation decodingminimizing word error ratenonexhaustive optimum word decoding algorithm
Related Items
Small Strong Blocking Sets by Concatenation, Three Combinatorial Perspectives on Minimal Codes, Unnamed Item, The maximum number of minimal codewords in an \([n,k\)-code], On the minimum number of minimal codewords, Decomposition of modular codes for computing test sets and Graver basis, Fuzzy codes and distance properties, New approaches to reduced-complexity decoding, Construction of minimal linear codes from multi-variable functions, On the maximum number of minimal codewords, On the non-minimal codewords in binary Reed-Muller codes, On the number of minimal codewords in codes generated by the adjacency matrix of a graph
