FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2765658857> ?p ?o ?g. }

• W2765658857 endingPage "321" @default.
• W2765658857 startingPage "309" @default.
• W2765658857 abstract "It is known that polar codes can be efficiently constructed for binary-input channels. At the same time, existing algorithms for general input alphabets are less practical because of high complexity. We address the construction problem for the general case, and analyze an algorithm that is based on successive reduction of the output alphabet size of the subchannels in each recursion step. For this procedure, we estimate the approximation error as O(μ <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-1</sup> /(q <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>-1</sup> )), where q is the input alphabet size and μ is the “quantization parameter,” i.e., the maximum size of the subchannel output alphabet allowed by the algorithm. The complexity of the code construction scales as O(N μ <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> log μ), where N is the length of the code. We also show that if the polarizing operation relies on modulo-q addition, it is possible to merge subsets of output symbols without any loss in subchannel capacity. Performing this procedure before each approximation step results in a further speed-up of the code construction, and the resulting codes have smaller gap to capacity. We also show that a similar acceleration can be attained for polar codes over finite field alphabets. Experimentation shows that the suggested construction algorithms can be used to construct long polar codes for alphabets of size q = 16 and more with acceptable loss of the code rate for a variety of polarizing transforms." @default.
• W2765658857 created "2017-11-10" @default.
• W2765658857 creator A5004622357 @default.
• W2765658857 creator A5032432450 @default.
• W2765658857 creator A5061537073 @default.
• W2765658857 date "2018-01-01" @default.
• W2765658857 modified "2023-10-16" @default.
• W2765658857 title "Construction of Polar Codes for Arbitrary Discrete Memoryless Channels" @default.
• W2765658857 cites W1971123554 @default.
• W2765658857 cites W1975096885 @default.
• W2765658857 cites W1975800702 @default.
• W2765658857 cites W1981107808 @default.
• W2765658857 cites W1981735015 @default.
• W2765658857 cites W1983447663 @default.
• W2765658857 cites W1998875316 @default.
• W2765658857 cites W2009145605 @default.
• W2765658857 cites W2031700647 @default.
• W2765658857 cites W2055534149 @default.
• W2765658857 cites W2076129236 @default.
• W2765658857 cites W2099111195 @default.
• W2765658857 cites W2107211662 @default.
• W2765658857 cites W2126931301 @default.
• W2765658857 cites W2145712176 @default.
• W2765658857 cites W2150498905 @default.
• W2765658857 cites W2150518053 @default.
• W2765658857 cites W2158137498 @default.
• W2765658857 cites W2159793310 @default.
• W2765658857 cites W2161541170 @default.
• W2765658857 cites W2164368671 @default.
• W2765658857 cites W2169877013 @default.
• W2765658857 cites W2170869643 @default.
• W2765658857 cites W2172906094 @default.
• W2765658857 cites W2569093245 @default.
• W2765658857 cites W2588040356 @default.
• W2765658857 cites W2964312190 @default.
• W2765658857 cites W3099516920 @default.
• W2765658857 cites W3100119739 @default.
• W2765658857 cites W3123299285 @default.
• W2765658857 cites W3124439737 @default.
• W2765658857 doi "https://doi.org/10.1109/tit.2017.2765663" @default.
• W2765658857 hasPublicationYear "2018" @default.
• W2765658857 type Work @default.
• W2765658857 sameAs 2765658857 @default.
• W2765658857 citedByCount "28" @default.
• W2765658857 countsByYear W27656588572016 @default.
• W2765658857 countsByYear W27656588572017 @default.
• W2765658857 countsByYear W27656588572018 @default.
• W2765658857 countsByYear W27656588572019 @default.
• W2765658857 countsByYear W27656588572020 @default.
• W2765658857 countsByYear W27656588572021 @default.
• W2765658857 countsByYear W27656588572022 @default.
• W2765658857 countsByYear W27656588572023 @default.
• W2765658857 crossrefType "journal-article" @default.
• W2765658857 hasAuthorship W2765658857A5004622357 @default.
• W2765658857 hasAuthorship W2765658857A5032432450 @default.
• W2765658857 hasAuthorship W2765658857A5061537073 @default.
• W2765658857 hasBestOaLocation W27656588571 @default.
• W2765658857 hasConcept C112876837 @default.
• W2765658857 hasConcept C11413529 @default.
• W2765658857 hasConcept C114614502 @default.
• W2765658857 hasConcept C118615104 @default.
• W2765658857 hasConcept C138885662 @default.
• W2765658857 hasConcept C148764684 @default.
• W2765658857 hasConcept C154504017 @default.
• W2765658857 hasConcept C197129107 @default.
• W2765658857 hasConcept C199360897 @default.
• W2765658857 hasConcept C23123220 @default.
• W2765658857 hasConcept C33923547 @default.
• W2765658857 hasConcept C41008148 @default.
• W2765658857 hasConcept C41895202 @default.
• W2765658857 hasConcept C54732982 @default.
• W2765658857 hasConcept C77926391 @default.
• W2765658857 hasConceptScore W2765658857C112876837 @default.
• W2765658857 hasConceptScore W2765658857C11413529 @default.
• W2765658857 hasConceptScore W2765658857C114614502 @default.
• W2765658857 hasConceptScore W2765658857C118615104 @default.
• W2765658857 hasConceptScore W2765658857C138885662 @default.
• W2765658857 hasConceptScore W2765658857C148764684 @default.
• W2765658857 hasConceptScore W2765658857C154504017 @default.
• W2765658857 hasConceptScore W2765658857C197129107 @default.
• W2765658857 hasConceptScore W2765658857C199360897 @default.
• W2765658857 hasConceptScore W2765658857C23123220 @default.
• W2765658857 hasConceptScore W2765658857C33923547 @default.
• W2765658857 hasConceptScore W2765658857C41008148 @default.
• W2765658857 hasConceptScore W2765658857C41895202 @default.
• W2765658857 hasConceptScore W2765658857C54732982 @default.
• W2765658857 hasConceptScore W2765658857C77926391 @default.
• W2765658857 hasFunder F4320306076 @default.
• W2765658857 hasIssue "1" @default.
• W2765658857 hasLocation W27656588571 @default.
• W2765658857 hasLocation W27656588572 @default.
• W2765658857 hasOpenAccess W2765658857 @default.
• W2765658857 hasPrimaryLocation W27656588571 @default.
• W2765658857 hasRelatedWork W1998083236 @default.
• W2765658857 hasRelatedWork W2011381619 @default.
• W2765658857 hasRelatedWork W2067307917 @default.
• W2765658857 hasRelatedWork W2140463246 @default.
• W2765658857 hasRelatedWork W2148800638 @default.

• next