A formalized optimum code search for q-ary trellis codes
Loading...
Files
External sources
External sources
Date
Authors
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Type
Work presented at event
Access right
Acesso aberto
Files
External sources
External sources
Abstract
This paper gives a formalization for q-ary codes of the search algorithm [3] for optimum codes based on lattices and cosets [1]. With a more efficient and an automated algorithm it also has been possible to extend the search for larger convolutional encoder parameters and lattices partitions. New optimum binary, ternary and quaternary trellis codes are listed together with their coding gains.
Description
Keywords
Algorithms, Binary codes, Convolutional codes, Encoding (symbols), Lattice partitions, Q ary codes, Trellis codes
Language
English
Citation
Conference Record / IEEE Global Telecommunications Conference, v. 2, p. 948-952.
