Algoritmo Geral para a Procura De Códigos Treliça Ótimos Baseados em Partições de Reticulados
Main Article Content
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.
Article Details
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
Issue
Section
Regular Papers
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
___________