DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mihaljević, Miodrag J. | en |
dc.date.accessioned | 2020-03-05T20:28:26Z | - |
dc.date.available | 2020-03-05T20:28:26Z | - |
dc.date.issued | 1996-01-01 | en |
dc.identifier.issn | 0044-2267 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/153 | - |
dc.description.abstract | A novel approach to the decoding of a general binary block code assuming transmission of the codewords through a specific channel is proposed and analyzed. Roughly speaking, the codewords transmitted through considered channel are degraded by deletion of a number of bits and by complementation of a number of the remained bits. Certain minimum distance decoding (MDD) based on the sequence comparison approach is proposed. A decoding performance is analyzed through the uncertainty after the MDD procedure. A lower bound on the number of codewords at zero-distance to the received one after the MDD is derived. Illustrative numerical examples are also included. | en |
dc.publisher | Wiley-VCH Verlag | - |
dc.relation.ispartof | ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik | en |
dc.title | A sequence comparison approach for decoding of general binary block code after the binary summetric channel with synchronization errors | en |
dc.type | Article | en |
dc.identifier.scopus | 2-s2.0-33747512866 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 479 | en |
dc.relation.lastpage | 480 | en |
dc.relation.volume | 76 | en |
dc.description.rank | M23 | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.orcid | 0000-0003-3047-3020 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.