Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/64593
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Trifonov, Peter | en |
dc.contributor.author | Miloslavskaya, Vera | en |
dc.date.accessioned | 2025-01-25T07:02:55Z | - |
dc.date.available | 2025-01-25T07:02:55Z | - |
dc.date.issued | 2016-02 | - |
dc.identifier.citation | IEEE Journal on Selected Areas in Communications, 34(2), p. 254-266 | en |
dc.identifier.issn | 1558-0008 | en |
dc.identifier.issn | 0733-8716 | en |
dc.identifier.uri | https://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.language | en | en |
dc.publisher | Institute of Electrical and Electronics Engineers | en |
dc.relation.ispartof | IEEE Journal on Selected Areas in Communications | en |
dc.title | Polar Subcodes | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1109/JSAC.2015.2504269 | en |
local.contributor.firstname | Peter | en |
local.contributor.firstname | Vera | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | vmilosla@une.edu.au | en |
local.output.category | C1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.publisher.place | United States of America | en |
local.format.startpage | 254 | en |
local.format.endpage | 266 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 34 | en |
local.identifier.issue | 2 | en |
local.contributor.lastname | Trifonov | en |
local.contributor.lastname | Miloslavskaya | en |
dc.identifier.staff | une-id:vmilosla | en |
local.profile.orcid | 0000-0003-2147-2448 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/64593 | en |
local.date.onlineversion | 2015-11-26 | - |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | Polar Subcodes | en |
local.relation.fundingsourcenote | 10.13039/501100002261-Russian Foundation for Basic Research (Grant Number: 12-01-00365-a) | en |
local.output.categorydescription | C1 Refereed Article in a Scholarly Journal | en |
local.search.author | Trifonov, Peter | en |
local.search.author | Miloslavskaya, Vera | en |
local.open.fileurl | https://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949d | en |
local.uneassociation | Unknown | en |
local.atsiresearch | No | en |
local.sensitive.cultural | No | en |
local.year.available | 2015 | en |
local.year.published | 2016 | en |
local.fileurl.open | https://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949d | en |
local.fileurl.closedpublished | https://rune.une.edu.au/web/retrieve/12e1b3be-3f81-4caf-bf32-3d202965949d | en |
local.subject.for2020 | 461301 Coding, information theory and compression | en |
local.subject.for2020 | 460199 Applied computing not elsewhere classified | en |
local.subject.seo2020 | 220107 Wireless technologies, networks and services | en |
local.codeupdate.date | 2025-02-01T16:31:54.193 | en |
local.codeupdate.eperson | vmilosla@une.edu.au | en |
local.codeupdate.finalised | true | en |
local.original.for2020 | 4601 Applied computing | en |
local.profile.affiliationtype | External Affiliation | en |
local.profile.affiliationtype | External Affiliation | en |
local.date.moved | 2025-01-31 | en |
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.