| 329 | -- | 0 | Neil J. A. Sloane. Papers in honor of F. Jessie MacWilliams |
| 330 | -- | 331 | Cornelius Roos. A new lower bound for the minimum distance of a cyclic code |
| 332 | -- | 336 | A. Robert Calderbank. A square root bound on the minimum weight in quasi-cyclic codes |
| 337 | -- | 341 | Harold N. Ward. Divisors of codeword weights |
| 342 | -- | 344 | R. D. Baker, Jacobus H. van Lint, Richard M. Wilson. On the Preparata and Goethals codes |
| 345 | -- | 348 | William M. Kantor. On the inequivalence of generalized Preparata codes |
| 349 | -- | 351 | M. R. Best. Perfect codes hardly exist |
| 352 | -- | 353 | Gérard D. Cohen. A nonconstructive upper bound on covering radius |
| 354 | -- | 355 | Nick J. Patterson, Douglas H. Wiedemann. The covering radius of the (2:::15:::, 16) Reed-Muller code is at least 16276 |
| 356 | -- | 358 | H. F. Mattson Jr.. Another upper bound on covering radius |
| 359 | -- | 363 | E. F. Assmus Jr., Vera Pless. On the coveting radius of extremal self-dual codes |
| 364 | -- | 366 | Neil J. A. Sloane, John G. Thompson. Cyclic self-dual codes |
| 367 | -- | 369 | E. F. Assmus Jr.. The binary code arising from a 2-design with a nice collection of ovals |
| 370 | -- | 371 | Andries E. Brouwer. On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code |
| 372 | -- | 377 | Elwyn R. Berlekamp. The construction of fast, high-rate, soft decision block decoders |
| 378 | -- | 385 | Paul Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials |
| 386 | -- | 389 | Henk C. A. van Tilborg. Upper bounds on |C::2::| for a uniquely decodable code pair (C::1::, C::2::) for a two-access binary adder channel |
| 390 | -- | 395 | Thomas H. E. Ericson, János Körner. Successive encoding of correlated sources |
| 396 | -- | 411 | Rudolf Ahlswede, Te Sun Han. On source coding with side information via a multiple-access channel and related problems in multi-user information theory |
| 412 | -- | 425 | Boaz Porat, Benjamin Friedlander. Estimation of spatial and spectral parameters of multiple sources |
| 426 | -- | 433 | A. F. Gualtierotti. On the stability of signal detection |
| 434 | -- | 438 | Tor Helleseth. New constructions of codes meeting the Griesmer bound |
| 439 | -- | 0 | Max H. M. Costa. Writing on dirty paper |
| 441 | -- | 0 | Frans M. J. Willems. The discrete memoryless multiple access channel with partially cooperating encoders |
| 445 | -- | 0 | J. Pieter M. Schalkwijk. On an extension of an achievable rate region for the binary multiplying channel |
| 448 | -- | 0 | Gadiel Seroussi, Abraham Lempel. Maximum likelihood decoding of certain Reed - Muller codes |
| 454 | -- | 0 | Luigi M. Ricciardi, Shunsuke Sato. A note on first passage time problems for Gaussian processes and varying boundaries |
| 457 | -- | 0 | J. Glaz. Moving window detection for discrete data |
| 462 | -- | 0 | Ning Hsing Lu, Bruce A. Eisenstein. Suboptimum detection of weak signals in non-Gaussian noise |
| 466 | -- | 0 | S. P. Bruzzone, Mostafa Kaveh. A criterion for selecting information- preserving data reductions for use in the design of multiple-parameter estimators |