Easily decodable binary cyclic codes

This paper presents a class of binary cyclic codes with block length n = 2 m − 1, having n−k = 2 m− parity checks and a minimum distance d=m +1, where m is an integer. These codes are shown to be majority logic decodable in one step by making use of the concept of a quasi-perfect finite difference s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of electronics 1983-01, Vol.55 (3), p.465-467
1. Verfasser: ROCHA, VALDEMAR CARDOSO DA
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a class of binary cyclic codes with block length n = 2 m − 1, having n−k = 2 m− parity checks and a minimum distance d=m +1, where m is an integer. These codes are shown to be majority logic decodable in one step by making use of the concept of a quasi-perfect finite difference set.
ISSN:0020-7217
1362-3060
DOI:10.1080/00207218308961616