Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity (original) (raw)
Related papers
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
IEEE Transactions on Information Theory, 1985
Computing the Minimum Distance of Linear Codes by the Error Impulse Method
… , 2002. GLOBECOM'02, 2002
Decoding Linear Codes via Optimization and Graph-Based Techniques
2008
An optimum symbol-by-symbol decoding rule for linear codes
IEEE Transactions on Information Theory, 1976
Low-Complexity LP Decoding of Nonbinary Linear Codes
IEEE Transactions on Communications, 2000
Low Complexity Linear Programming Decoding of Nonbinary Linear Codes
Computing Research Repository, 2010
Minimum-distance bounds for binary linear codes
IEEE Transactions on Information Theory, 1973
Encoding and decoding for the minimization of message symbol error rates in linear block codes
IEEE Transactions on Information Theory, 1987
IEEE Transactions on Information Theory, 1970
Using Linear Programming to Decode Linear Codes
2003
Optimal linear codes with a local-error-correction property
2012 IEEE International Symposium on Information Theory Proceedings, 2012
Error-Correction Capability of Binary Linear Codes
IEEE Transactions on Information Theory, 2005
Decoding of linear block codes based on ordered statistics
Linear-Programming Decoding of Nonbinary Linear Codes
IEEE Transactions on Information Theory, 2009
Linear Codes with Non-Uniform Error Correction Capability
Designs, Codes and Cryptography, 1997
New Communication Models and Decoding of Maximum Rank Distance Codes
2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY)
Minimal vectors in linear codes
IEEE Transactions on Information Theory, 1998
On interpolation-based decoding of a class of maximum rank distance codes
2021 IEEE International Symposium on Information Theory (ISIT), 2021
High Speed Soft Decision Decoding of Linear Codes Based on Hash and Syndrome Decoding
International Journal of Intelligent Engineering and Systems, 2019
Distance Preserving Mapping and Simple Intelligent Decoder for Modified Linear Block Code
2019
On two probabilistic decoding algorithms for binary linear codes
IEEE Transactions on Information Theory, 1991
An optimal partial decoding algorithm for rateless codes
2011 IEEE International Symposium on Information Theory Proceedings, 2011
Coding theory and applications, linear codes
2013
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
On the Complexity of the Greedy Construction of Linear Error-Correcting Codes
Coding Theory - Algorithms, Architectures, and Applications [Andre Neubauer et al.]
On the computation of the minimum distance of low-density parity-check codes
2004
IEEE Transactions on Information Theory, 1998
On the complete decoding of binary linear codes (Corresp.)
IEEE Transactions on Information Theory, 1985
Decoding algorithms with input quantization and maximum error correction capability
IEEE Transactions on Information Theory, 1995
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory, 2003
Optimizing the free distance of Error-Correcting Variable-Length Codes
2010 IEEE International Workshop on Multimedia Signal Processing, 2010
Hamming Codes: Error Reducing Techniques
International Journal for Research in Applied Science and Engineering Technology (IJRASET) , 2021