Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Construction of perfect q-ary codes by switchings of simple components
Los’ A. Problems of Information Transmission42 (1):30-37,2006.Type:Article
Date Reviewed: Nov 7 2006

One task of coding theory is to determine the number of nonequivalent codes (or even give explicit constructions) with prescribed parameters, such as minimum weight, length, and dimension (for linear codes). In this paper, the author presents a construction of perfect q-ary codes by using the method he introduced in an earlier paper [1]. By counting the number of distinct codes obtained from this method, the author makes an improvement on the lower bound for the size of perfect q-ary codes with length n=(qm-1)/(q-1).

Thus, the main contribution of this paper is the improvement on the lower bound of the size of perfect q-ary codes with the given length. Another interesting achievement, originally given in the author’s earlier paper [1], is the explicit construction of perfect q-ary codes, which may be developed and applied to other codes in the future.

Reviewer:  Hao Wang Review #: CR133525 (0710-1011)
1) Los’, A.V. Construction of perfect q-ary codes by sequential switchings of alpha-components. Problems of Information Transmission 40, 1(2004), 37–43.
Bookmark and Share
 
Coding And Information Theory (E.4 )
 
 
Code Breaking (E.3 ... )
 
 
General (F.2.0 )
 
 
Data Encryption (E.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Coding And Information Theory": Date
Bruck nets, codes, and characters of loops
Moorhouse G. Designs, Codes and Cryptography 1(1): 7-29, 1991. Type: Article
Jul 1 1992
A simple proof of the Delsarte inequalities
Simonis J., de Vroedt C. Designs, Codes and Cryptography 1(1): 77-82, 1991. Type: Article
Dec 1 1991
Diacritical analysis of systems
Oswald J., Ellis Horwood, Upper Saddle River, NJ, 1991. Type: Book (9780132087520)
Aug 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy