Algoritmo Geral para a Procura De Códigos Treliça Ótimos Baseados em Partições de Reticulados

  • E. M. Rosa
  • W. C. Borelli
  • P. G. Farrel
Keywords: códigos treliça, códigos convolucionais, partições de reticulados, cosets, códigos ótimos, algoritmo de procura.

Abstract

In this paper a general algorithm for the search of optimum q-ary trellis codes, based on lattices and cosets, is proposed. The algorithm incorporates the procedures introduced for binary codes in [2],[4] and generalizes the search for alphabets that are rings with q elements, Z_q. New characteristics were incorporated to the algorithm, providing a faster and more efficient search for the optimum codes than in [3],[4],[5]. Numerical examples are presented in details for binary scheme with the Z^2/\thetaZ^2 partition and for a ternary scheme with the A_2/9A_2 partition.
Published
07-04-2017
How to Cite
Rosa, E. M., Borelli, W. C., & Farrel, P. G. (2017). Algoritmo Geral para a Procura De Códigos Treliça Ótimos Baseados em Partições de Reticulados. Journal of Communication and Information Systems, 13(1). https://doi.org/10.14209/jcis.1998.9
Section
Regular Papers