The theory of signal detectability
- W. W. Peterson, T. Birdsall, W. C. Fox
- Computer ScienceTransactions of the IRE Professional Group on…
- 1 September 1954
Seven special cases which are presented were chosen from the simplest problems in signal detection which closely represent practical situations and should serve to suggest methods for attacking other simple signal detection problems and to give insight into problems too complicated to allow a direct solution.
Encoding and error-correction procedures for the Bose-Chaudhuri codes
- W. W. Peterson
- Computer ScienceIRE Transactions on Information Theory
- 1 September 1960
A simple error-correction procedure for binary codes which for arbitrary m and t are t -error correcting and have length 2^m - 1 of which no more than mt digits are redundancy is described.
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application
- T. Kasami, Shu Lin, W. W. Peterson
- Computer ScienceInformation and Control
- 15 August 1966
Addressing for Random-Access Storage
- W. W. Peterson
- Computer ScienceIBM Journal of Research and Development
- 1 April 1957
Estimates are made of the amount of searching required for the exact location of a record in several types of storage systems, including the index-table method of addressing and the sorted-file…
Error-Correcting Codes
- W. W. Peterson
- Computer Science
- 1 May 1962
New generalizations of the Reed-Muller codes-I: Primitive codes
- T. Kasami, Shu Lin, W. W. Peterson
- Computer ScienceIEEE Transactions on Information Theory
- 1 March 1968
A natural generalization to the nonbinary case is presented, which also includes the Reed-Muller codes and Reed-Solomon codes as special cases and the generator polynomial is characterized and the minimum weight is established.
Some Results on Quasi-Cyclic Codes
- C. L. Chen, W. W. Peterson, E. Weldon
- Computer ScienceInformation and Control
- 1 November 1969
Cyclic Codes for Error Detection
- W. W. Peterson, D. T. Brown
- Computer ScienceProceedings of the IRE
- 1961
The potentialities of these codes for error detection and the equipment required for implementing error detection systems using cyclic codes are described in detail.
Polynomial codes
- T. Kasami, Shu Lin, W. W. Peterson
- Computer ScienceIEEE Transactions on Information Theory
- 1 November 1968
A class of cyclic codes is introduced by a polynomial approach that is an extension of the Mattson-Solomon method and of the Muller method and some subclasses are shown to be majority-logic decodable.
Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect
- D. Gorenstein, W. W. Peterson, N. Zierler
- Computer Science, PhysicsInformation and Control
- 1 September 1960
...
...