Result 201 to 211 of 211 total
A survey of constructive coding theory, and a table of binary codes of highest known rate. (English)
Discrete Math. 3, 265-294 (1972).
201
New binary codes. (English)
IEEE Trans. Inf. Theory 18, 503-510 (1972).
202
Gleason’s theorem on self-dual codes. (English)
IEEE Trans. Inf. Theory 18, 409-414 (1972).
203
Coset analysis of Reed Muller codes via translates of finite vector spaces. (English)
Inform. and Control 20, 410-414 (1972).
204
On finding the paths through a network. (English)
Bell System Tech. J. 51, 371-390 (1972).
205
Coset analysis of Reed muller codes via translates of finite vector spaces (English)
Information and Control 20, No. 5, 410-414 (1972).
206
Sphere packings and error-correcting codes. (English)
Can. J. Math. 23, 718-745 (1971).
207
A new family of nonlinear codes obtained from conference matrices. (English)
Ann. N.Y. Acad. Sci. 175, 363-365 (1970).
208
New family of single-error correcting codes. (English)
IEEE Trans. Inf. Theory 16, 717-719 (1970).
209
Weight enumerator for second-order Reed-Muller codes. (English)
IEEE Trans. Inf. Theory 16, 745-751 (1970).
210
Restrictions on weight distribution of Reed-muller codes (English)
Information and Control 14, No. 5, 442-456 (1969).
211
Result 201 to 211 of 211 total
Start
Contact
Print
General Help
