TY - GEN

T1 - Minimal error-trellises for linear block codes

AU - Ariel, M.

AU - Snyders, J.

PY - 1998

Y1 - 1998

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

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

UR - http://www.scopus.com/inward/record.url?scp=84890401062&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1998.708831

DO - 10.1109/ISIT.1998.708831

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84890401062

SN - 0780350006

SN - 9780780350007

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 228

BT - Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998

T2 - 1998 IEEE International Symposium on Information Theory, ISIT 1998

Y2 - 16 August 1998 through 21 August 1998

ER -