|Authors:||Mihaljević, Miodrag J.||Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance||Journal:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||Volume:||1255||First page:||237||Last page:||249||Issue Date:||1-Jan-1997||Rank:||M23||ISBN:||978-3-540-63163-7||ISSN:||0302-9743||DOI:||10.1007/3-540-63163-1_19||Abstract:||
An algorithm for decoding of linear binary block codes based on the iterative probabilistic error-correction is considered theoretically and experimentally. Assuming the sparse code parity-check matrix it is demonstrated that, with probability close to one, the algorithm works far beyond the half minimum distance with complexity linearly proportional to the codeword length and the average number of per bit employed parity-checks.
|Keywords:||Algebra | Algorithms | Bins | Block codes | Codes (symbols) | Decoding | Error correction | ErrorsIterative methods | Matrix algebra||Publisher:||Springer Link|
Show full item record
checked on Aug 11, 2023
checked on Sep 12, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.