New families of perfect linear error-block codes
by Rabiî Dariti; El Mamoun Souidi
International Journal of Information and Coding Theory (IJICOT), Vol. 2, No. 2/3, 2013

Abstract: Linear error-block codes are a natural generalisation of linear error correcting codes. In this paper, we revisit all the known results on perfect linear error-block codes. We give the parameters of all perfect codes of minimum π-distance 3 and 4. The existence of new families of perfect codes is proven and their constructions are given. Moreover, some of these families are simultaneously perfect and MDS. Experimental results show that there exists only one class of parameters of perfect linear error-block codes of minimum π-distance 5. It is not likely to find further classes.

Online publication date: Sat, 13-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com