Back to Search
Start Over
Cyclically permutable representations of cyclic codes
- Source :
- Discrete Applied Mathematics. (1):76-81
- Publisher :
- Elsevier B.V.
-
Abstract
- Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple-access (CDMA) radio systems and optical CDMA. The usual emphasis is on finding constant weight cyclically permutable codes with the maximum number of codewords. In this paper the question of when a particular error-correcting code is equivalent (by permutation of the symbols) to a cyclically permutable code is addressed. The problem is introduced for simplex codes and a motivating example is given. In the final section it is shown that the construction technique may be applied in general to cyclic codes.
- Subjects :
- Block code
Discrete mathematics
Code division multiple access
Applied Mathematics
Cyclically permutable codes
Synchronization
Combinatorics
Permutation
Code (cryptography)
Discrete Mathematics and Combinatorics
Simplex codes
Permutable prime
Error detection and correction
Constant (mathematics)
Cyclic codes
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Issue :
- 1
- Database :
- OpenAIRE
- Journal :
- Discrete Applied Mathematics
- Accession number :
- edsair.doi.dedup.....030d8953a079f5a2c5d5850591bac586
- Full Text :
- https://doi.org/10.1016/j.dam.2007.08.038