Loading…
On superimposed codes based on incidence systems
Binary superimposed codes were introduced by W.H. Kauts and R.C. Singleton in 1964. In 1989 A.D. D'yachkov et al. suggested concept of superimposed code distance. In 1996 a new construction based on the incidence of the finite sets was suggested by A.J. Macula. It was studied and generalized in...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Binary superimposed codes were introduced by W.H. Kauts and R.C. Singleton in 1964. In 1989 A.D. D'yachkov et al. suggested concept of superimposed code distance. In 1996 a new construction based on the incidence of the finite sets was suggested by A.J. Macula. It was studied and generalized in 1998 by P.A. Vilenkin. We consider the further extension of this construction, which allows to create new superimposed codes from the existing ones. We also find the superimposed distance for this construction. |
---|---|
DOI: | 10.1109/ISIT.2000.866293 |