A decoding scheme for the 4 -ary lexicodes with D = 3

D. G. Kim and H. K. Kim

International Journal of Mathematics and Mathematical Sciences, 2002, vol. 29, 1-6

Abstract:

We introduce the algorithms for basis and decoding of quaternary lexicographic codes with minimum distance d = 3 for an arbitrary length n .

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/29/190694.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/29/190694.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:190694

DOI: 10.1155/S0161171202011444

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().