DC FieldValueLanguage
dc.contributor.authorMihaljević, Miodrag J.en
dc.date.accessioned2020-03-05T20:28:26Z-
dc.date.available2020-03-05T20:28:26Z-
dc.date.issued1997-01-01en
dc.identifier.isbn978-3-540-63163-7en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/150-
dc.description.abstractAn 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.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectAlgebra | Algorithms | Bins | Block codes | Codes (symbols) | Decoding | Error correction | ErrorsIterative methods | Matrix algebra-
dc.titleAn iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distanceen
dc.typeArticleen
dc.identifier.doi10.1007/3-540-63163-1_19en
dc.identifier.scopus2-s2.0-84862707997en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage237en
dc.relation.lastpage249en
dc.relation.volume1255en
dc.description.rankM23-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-3047-3020-
Show simple item record

SCOPUSTM   
Citations

2
checked on Jul 21, 2024

Page view(s)

54
checked on May 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.