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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 63; no. 11; pp. 7178 - 7205
Main Authors:	Jeong, Jisu, Kim, Eun Jung, Oum, Sang-il
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!