A new class of quaternary codes

Problems of Information Transmission

Volumn 42, Issue 1, 2006, Pages 1-9

  Stepanov, S A ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); MATHEMATICAL MODELS; MATRIX ALGEBRA;

BUTSON-HADAMARD MATRICES; FINITE CYCLIC GROUP; PLOTKIN BOUND; QUATERNARY CODES;

CODES (SYMBOLS);

EID: 33646004625     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1134/S0032946006010017     Document Type: Article

References (8)

1. Elliot, D.F. and Rao, K.R., Fast Transforms: Algorithms, Analyses, Applications, New York: Academic, 1982.
2. Maslen, D.K. and Rockmore, D.N., Generalized FFTs-A Survey of Some Recent Results, Groups and Computation II: Workshop on Groups and Computation, Finkelstein, L. and Kantor, W.M., Eds. Providence: AMS, 1997, pp. 183-237.
3. Butson, K.T., Generalized Hadamard Matrices, Proc. Amer. Math. Soc., 1962, vol. 13, pp. 894-898.
4. Baliga, A., New Self-dual Codes from Cocyclic Hadamard Matrices, J. Comb. Math. Comb. Comput., 1982, vol. 28, pp. 7-14.
5. 2, Australian J. Comb., 1995, vol. 11, pp. 123-134.
6. Horadam, K.J. and Udaya, P., Cocyclic Hadamard Codes, IEEE Trans. Inform. Theory, 2000, vol. 46, pp. 1545-1550.
7. 2, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 9, pp. 2165-2169.
8. Stepanov, S.A. and Lee, M.H., Codes from Generalized Hadamard Matrices, submitted for publication in IEEE Trans. Inform. Theory.