Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/64594
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Miloslavskaya, Vera | en |
dc.date.accessioned | 2025-01-25T07:02:57Z | - |
dc.date.available | 2025-01-25T07:02:57Z | - |
dc.date.issued | 2015-09 | - |
dc.identifier.citation | IEEE Transactions on Information Theory, 61(9), p. 4852-4865 | en |
dc.identifier.issn | 1557-9654 | en |
dc.identifier.issn | 0018-9448 | en |
dc.identifier.uri | https://hdl.handle.net/1959.11/64594 | - |
dc.description.abstract | <p>An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.</p> | en |
dc.language | en | en |
dc.publisher | Institute of Electrical and Electronics Engineers | en |
dc.relation.ispartof | IEEE Transactions on Information Theory | en |
dc.title | Shortened Polar Codes | en |
dc.type | Journal Article | en |
dc.identifier.doi | 10.1109/TIT.2015.2453312 | 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 | 4852 | en |
local.format.endpage | 4865 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 61 | en |
local.identifier.issue | 9 | 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.identifier.unepublicationid | une:1959.11/64594 | en |
local.date.onlineversion | 2015-07-08 | - |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | Shortened Polar Codes | en |
local.relation.fundingsourcenote | 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 | Miloslavskaya, Vera | en |
local.uneassociation | No | en |
local.atsiresearch | No | en |
local.sensitive.cultural | No | en |
local.year.available | 2015 | en |
local.year.published | 2015 | en |
local.subject.for2020 | 4601 Applied computing | en |
local.profile.affiliationtype | External Affiliation | en |
local.date.moved | 2025-01-31 | en |
Appears in Collections: | Journal Article School of Science and Technology |
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.