The "Art of Trellis Decoding" Is Fixed-Parameter Tractable

Given n subspaces of a finite-dimensional vector space over a fixed finite field F, we wish to find a linear layout V 1 , V 2 ,..., V n of the subspaces such that dim((V 1 + V 2 + ··· + V i ) ∩ (V i+1 + ··· + V n )) ≤ k for all i; such a linear layout is said to have width at most k. When restricted...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 63; číslo 11; s. 7178 - 7205
Hlavní autori:	Jeong, Jisu, Kim, Eun Jung, Oum, Sang-il
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Predmet:	Algorithms branch-width Complexity theory Computation Computer Science Decision theory Decoding Decomposition Dynamic programming Fields (mathematics) Heuristic algorithms Layout Layouts linear clique-width linear code Linear codes linear rank-width matroid Parameterized complexity Parameters path-width Subspaces trellis state-complexity trellis-width
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!