Publication:
Heuristic construction of high-rate linear block codes

Simple item page
dc.contributor.authorAltay, Gökmen
dc.contributor.authorUçan, Osman Nuri
dc.contributor.institutionAltay, Gökmen, Department of Electrical and Electronic Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey
dc.contributor.institutionUçan, Osman Nuri, Department of Electrical and Electronic Engineering, Istanbul Üniversitesi, Istanbul, Turkey
dc.date.accessioned2025-10-05T16:50:59Z
dc.date.issued2006
dc.description.abstractWe propose a new heuristic construction technique that generates all the even codes of length greater than 8 with full rank property for Hamming distance-4. The codes generated by the proposed method include the extended Hamming codes and the Reed Muller codes of distance-4. The way of obtaining the codes with higher minimum distance using the proposed method is also described. © 2005 Elsevier GmbH. All rights reserved. © 2015 Elsevier B.V., All rights reserved.
dc.identifier.doi10.1016/j.aeue.2005.12.004
dc.identifier.endpage666
dc.identifier.issn16180399
dc.identifier.issn14348411
dc.identifier.issue9
dc.identifier.scopus2-s2.0-33748328241
dc.identifier.startpage663
dc.identifier.urihttps://doi.org/10.1016/j.aeue.2005.12.004
dc.identifier.urihttps://hdl.handle.net/20.500.14719/13982
dc.identifier.volume60
dc.language.isoen
dc.publisherElsevier GmbH
dc.relation.sourceAEU - International Journal of Electronics and Communications
dc.subject.authorkeywordsCode Construction
dc.subject.authorkeywordsLinear Block Codes
dc.subject.authorkeywordsComputational Methods
dc.subject.authorkeywordsHeuristic Methods
dc.subject.authorkeywordsLinear Systems
dc.subject.authorkeywordsProblem Solving
dc.subject.authorkeywordsCode Construction
dc.subject.authorkeywordsHamming Codes
dc.subject.authorkeywordsLinear Block Codes
dc.subject.authorkeywordsBlock Codes
dc.subject.indexkeywordsComputational methods
dc.subject.indexkeywordsHeuristic methods
dc.subject.indexkeywordsLinear systems
dc.subject.indexkeywordsProblem solving
dc.subject.indexkeywordsCode construction
dc.subject.indexkeywordsHamming codes
dc.subject.indexkeywordsLinear block codes
dc.subject.indexkeywordsBlock codes
dc.titleHeuristic construction of high-rate linear block codes
dc.typeArticle
dcterms.referencesChannel Coding, (1999), Low Density Parity Check Codes, (1963), Chung, Saeyoung, On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit, IEEE Communications Letters, 5, 2, pp. 58-60, (2001), Oenning, Travis R., A low-density generator matrix interpretation of parallel concatenated single bit parity codes, IEEE Transactions on Magnetics, 37, 2 I, pp. 737-741, (2001), Garcia-Frias, Javier, Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix, IEEE Communications Letters, 7, 6, pp. 266-268, (2003), Pyndiah, Ramesh Mahendra, Near-optimum decoding of product codes: block turbo codes, IEEE Transactions on Communications, 46, 8, pp. 1003-1010, (1998), Li, Jing, Product accumulate codes: A class of codes with near-capacity performance and low decoding complexity, IEEE Transactions on Information Theory, 50, 1, pp. 31-46, (2004), Isaka, Motohiko, High-rate serially concatenated coding with extended hamming codes, IEEE Communications Letters, 9, 2, pp. 160-162, (2005), Brouwer, Andries E., An Updated Table of Minimum-Distance Bounds for Binary Linear Codes, IEEE Transactions on Information Theory, 39, 2, pp. 662-677, (1993), Lucas, Rainer, Iterative decoding of one-step majority logic decodable codes based on belief propagation, IEEE Transactions on Communications, 48, 6, pp. 931-937, (2000)
dspace.entity.typePublication
local.indexed.atScopus
person.identifier.scopus-author-id9275320800
person.identifier.scopus-author-id7004839213

Files

Collections

Scopus İndeksli Yayınlar Koleksiyonu