DocumentCode
318152
Title
A formalized optimum code search for q-ary trellis codes
Author
Rosa, E.M. ; Borelli, W.C. ; Farrell, P.G.
Author_Institution
Sao Paulo Univ., Brazil
Volume
2
fYear
1997
fDate
3-8 Nov 1997
Firstpage
948
Abstract
This paper gives a formalization for q-ary codes of the search algorithm for optimum codes based on lattices and cosets. With a more efficient and an automated algorithm it has also been possible to extend the search for larger convolutional encoder parameters and lattice partitions. New optimum binary, ternary and quaternary trellis codes are listed together with their coding gains
Keywords
convolutional codes; search problems; trellis codes; binary trellis codes; coding gains; convolutional encoder parameters; cosets; formalized optimum code search; lattice partitions; lattices; q-ary codes; quaternary trellis code; search algorithm; ternary trellis codes; trellis codes; Convolution; Convolutional codes; Lattices; Partitioning algorithms; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1997. GLOBECOM '97., IEEE
Conference_Location
Phoenix, AZ
Print_ISBN
0-7803-4198-8
Type
conf
DOI
10.1109/GLOCOM.1997.638466
Filename
638466
Link To Document