Result 1 to 11 of 11 total
Automorphisms of constant weight codes and of divisible designs. (English)
Des. Codes Cryptography 20, No.1, 89-97 (2000).
1
A characterization of some minihypers and its application to linear codes. (English)
Geom. Dedicata 74, No.3, 305-311 (1999).
2
Normal bases via general Gauss periods. (English)
Math. Comput. 68, No.225, 271-290 (1999).
3
Coding theory. Construction and application of linear codes. (Codierungstheorie. Konstruktion und Anwendung linearer Codes.) (German)
Berlin: Springer. xviii, 338 p. DM 69.00; öS 504.00; sFr 63.00; \sterling 26.50; \$ 39.45 (1998).
4
The translation planes of order 49 and their automorphism groups. (English)
Math. Comput. 67, No.223, 1207-1224 (1998).
5
A generalization of the Massey-Ding algorithm. (English)
Appl. Algebra Eng. Commun. Comput. 9, No.1, 1-14 (1998).
6
Decoding affine variety codes using Gröbner bases. (English)
Des. Codes Cryptography 13, No.2, 147-158 (1998).
7
Normal basis of the finite field ${\bbfF}_{2^{(p-1)p^m}}$ over ${\bbfF}_2$. (English)
IEEE Trans. Inf. Theory 43, No.2, 737-739 (1997).
8
Approximate constructions in finite fields. (English)
Cohen, S. (ed.) et al., Finite fields and applications. Proceedings of the 3rd international conference, Glasgow, UK, July 11‒14, 1995. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 233, 313-332 (1996).
9
Finite linear recurring sequences and homogeneous ideals. (English)
Appl. Algebra Eng. Commun. Comput. 7, No.5, 377-390 (1996).
10
Constructive problems for irreducible polynomials over finite fields. (English)
Gulliver, T. Aaron (ed.) et al., Information theory and applications. 3rd Canadian Workshop, Rockland, Ontario, Canada, May 30 - June 2, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 793, 1-23 (1994).
11
Result 1 to 11 of 11 total
Start
Contact
Print
General Help
