On efficient majority logic decodable codes

Abstract

-A particular shortening technique is applied to majority logic decodable codes of length 2’. The shortening technique yields new efficient codes of lengths n = 2p, where p is a prime, e.g., a (128,70) code with dmaj = 16. For moderately long code lengths (e.g., n = 2” or 2’“), a 20-25 percent increase in efficiency can be achieved over the best previously… (More)
DOI: 10.1109/TIT.1976.1055627

Topics

4 Figures and Tables

Slides referencing similar topics