Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/64593
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTrifonov, Peteren
dc.contributor.authorMiloslavskaya, Veraen
dc.date.accessioned2025-01-25T07:02:55Z-
dc.date.available2025-01-25T07:02:55Z-
dc.date.issued2016-02-
dc.identifier.citationIEEE Journal on Selected Areas in Communications, 34(2), p. 254-266en
dc.identifier.issn1558-0008en
dc.identifier.issn0733-8716en
dc.identifier.urihttps://hdl.handle.net/1959.11/64593-
dc.description.abstract<p>An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.</p>en
dc.languageenen
dc.publisherInstitute of Electrical and Electronics Engineersen
dc.relation.ispartofIEEE Journal on Selected Areas in Communicationsen
dc.titlePolar Subcodesen
dc.typeJournal Articleen
dc.identifier.doi10.1109/JSAC.2015.2504269en
local.contributor.firstnamePeteren
local.contributor.firstnameVeraen
local.profile.schoolSchool of Science and Technologyen
local.profile.emailvmilosla@une.edu.auen
local.output.categoryC1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.publisher.placeUnited States of Americaen
local.format.startpage254en
local.format.endpage266en
local.peerreviewedYesen
local.identifier.volume34en
local.identifier.issue2en
local.contributor.lastnameTrifonoven
local.contributor.lastnameMiloslavskayaen
dc.identifier.staffune-id:vmiloslaen
local.profile.orcid0000-0003-2147-2448en
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/64593en
local.date.onlineversion2015-11-26-
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitlePolar Subcodesen
local.relation.fundingsourcenote10.13039/501100002261-Russian Foundation for Basic Research (Grant Number: 12-01-00365-a)en
local.output.categorydescriptionC1 Refereed Article in a Scholarly Journalen
local.search.authorTrifonov, Peteren
local.search.authorMiloslavskaya, Veraen
local.open.fileurlhttps://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949den
local.uneassociationUnknownen
local.atsiresearchNoen
local.sensitive.culturalNoen
local.year.available2015en
local.year.published2016en
local.fileurl.openhttps://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949den
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949den
local.subject.for2020461301 Coding, information theory and compressionen
local.subject.for2020460199 Applied computing not elsewhere classifieden
local.subject.seo2020220107 Wireless technologies, networks and servicesen
local.codeupdate.date2025-02-01T16:31:54.193en
local.codeupdate.epersonvmilosla@une.edu.auen
local.codeupdate.finalisedtrueen
local.original.for20204601 Applied computingen
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
local.date.moved2025-01-31en
Appears in Collections:Journal Article
School of Science and Technology
Files in This Item:
1 files
File SizeFormat 
Show simple item record
Google Media

Google ScholarTM

Check

Altmetric


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