@inproceedings{25699db4a31e45d1851ed46c8a3c055b,

title = "Minimal error-trellises for linear block codes",

abstract = "An error-trellis is an efficient means to accomplish maximum likelihood decoding of a linear (n,k) block code C over GF(q). It represents the coset of C that contains the symbol-by-symbol detected version of the received vector. The trellis we construct has only n-k sections and the structure of each section is determined solely by the value of an associated q-ary symbol of the syndrome. Hence, the entire set of qn-k trellises for all the cosets of C is formed by a set of q(n-k) distinct sections. The error-trellis is invariant under permutation of coordinates and attains the vertex count of a minimal code-trellis with the same sectionalization.",

author = "M. Ariel and J. Snyders",

year = "1998",

doi = "10.1109/ISIT.1998.708831",

language = "אנגלית",

isbn = "0780350006",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "228",

booktitle = "Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998",

note = "null ; Conference date: 16-08-1998 Through 21-08-1998",

}