Constacyclic codes and cocycles

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 233-

  Hughes, G ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COCYCLES; COHOMOLOGY; CONSTACYCLIC CODES; CYCLIC CODE; DIRECT SUM; GALOIS RING; LOCAL RING; MODULAR RINGS;

INFORMATION THEORY;

CODING ERRORS;

EID: 0346173353     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708837     Document Type: Conference Paper

References (5)

1. E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.
2. E. Dubois and A.N. Venetsanopoulos, "The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution," IEEE Trans. Comp., vol. C-27, no. 7, pp. 586-593, July 1978.
3. K.J. Horadam and A.A.I Perera, "Codes from Cocycles," in Proc. AAECC-12, Lecture Notes in Computer Science 1255, Springer, New York, 1997.
4. G. Karpilovsky, Projective Representations oj Finite Groups, Marcel Dekker, New York, 1985.
5. A. Krishna and D. V. Sarwate, "Pseudocyclic Maximum-Distance- Separable Codes," IEEE Trans. Inform. Theory, vol. 36, no. 4, pp. 880-884, July 1990.