Result 81 to 100 of 776 total
On single-deletion-correcting codes. (English)
Arasu, K. T. (ed.) et al., Codes and designs. Proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, Columbus, OH, USA, May 18-21, 2000. Berlin: de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 10, 273-291 (2002).
81
A mass formulation for Type II codes over finite fields of characteristic two. (English)
Arasu, K. T. (ed.) et al., Codes and designs. Proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, Columbus, OH, USA, May 18-21, 2000. Berlin: de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 10, 207-214 (2002).
82
Decoding some doubly-even self-dual [32, 16, 8] codes by hand. (English)
Arasu, K. T. (ed.) et al., Codes and designs. Proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, Columbus, OH, USA, May 18-21, 2000. Berlin: de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 10, 165-178 (2002).
83
Binary and ternary codes of covering radius one: some new lower bounds. (English)
Discrete Math. 256, No.1-2, 161-178 (2002).
84
An enumeration of binary self-dual codes of length 32. (English)
Des. Codes Cryptography 26, No.1-3, 61-86 (2002).
85
Block squares. (English)
Math. Nachr. 241, 73-102 (2002).
86
New design of quaternary sequences. (English)
Appl. Algebra Eng. Commun. Comput. 13, No.2, 93-106 (2002).
87
A Gleason formula for Ozeki polynomials. (English)
J. Comb. Theory, Ser. A 98, No.1, 60-73 (2002).
88
On the automorphisms of order 2 with fixed points for the extremal self-dual codes of length 24$m$. (English)
Des. Codes Cryptography 25, No.1, 5-13 (2002).
89
On senary simplex codes. (English)
Boztaş, Serdar (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 14th international symposium, AAECC-14, Melbourne, Australia, November 26‒30, 2001. \newl Proceedings. Berlin: Springer (ISBN 3-540-42911-5). Lect. Notes Comput. Sci. 2227, 112-121 (2001).
90
Information hiding through noisy channels. (English)
Moskowitz, Ira S. (ed.), Information hiding. 4th international workshop, IH 2001, Pittsburgh, PA, USA, April 25-27, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2137, 42-50 (2001).
91
Graph configurations and decoding performance. (English)
Honary, Bahram (ed.), Cryptography and coding. 8th IMA international conference, Cirencester, GB, December 17-19, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2260, 158-165 (2001).
92
Nonbinary quantum stabilizer codes. (English)
IEEE Trans. Inf. Theory 47, No.7, 3065-3072 (2001).
93
A table of upper bounds for binary codes. (English)
IEEE Trans. Inf. Theory 47, No.7, 3004-3006 (2001).
94
Reed-Muller codes: Projections onto GF(4) and multilevel construction. (English)
IEEE Trans. Inf. Theory 47, No.6, 2560-2565 (2001).
95
Constellation labeling for linear encoders. (English)
IEEE Trans. Inf. Theory 47, No.6, 2417-2431 (2001).
96
Optimal block codes for $M$-ary runlength-constrained channels. (English)
IEEE Trans. Inf. Theory 47, No.5, 2069-2078 (2001).
97
On coset weight distributions of the ${\bbfZ}_4$-linear Goethals codes. (English)
IEEE Trans. Inf. Theory 47, No.5, 1758-1772 (2001).
98
A ${\Bbb Z}_8$-linear lift of the binary Golay code and a nonlinear binary $(96,2^{37},24)$-code. (English)
IEEE Trans. Inf. Theory 47, No.4, 1596-1598 (2001).
99
Fast calculation of the number of minimum-weight words of CRC codes. (English)
IEEE Trans. Inf. Theory 47, No.3, 1190-1195 (2001).
100
Result 81 to 100 of 776 total
Start
Contact
Print
General Help
