A note off two binary signaling alphabets
IEEE Transactions on Information TheoryPublished 1 June 1956
D. Slepian
Citations88
SJR quartileQ1
SJR score1.46
SNIP1.76
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A generalization of Hamming's single error correcting codes is given along with a simple maximum likelihood detection scheme for Reed-Muller alphabets and a new detection scheme is presented for them.
Abstract
A generalization of Hamming's single error correcting codes is given along with a simple maximum likelihood detection scheme. For small redundancy these alphabets are unexcelled. The Reed-Muller alphabets are described as parity check alphabets and a new detection scheme is presented for them.
Keywords
Computer ScienceEngineering
Bell System Technical JournalError Detecting and Error Correcting Codes
5,086 Citations1950R. W. Hamming
The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end result.
ERROR DETECTING AND ERROR CORRECTING CODES
3,222 Citations2014Neha Chauhan, Pooja Yadav +1 more
In this paper all error detecting and error correcting mechanisms are studied and best mechanism on the basis of accuracy, complexity and power consumption is selected.
Transactions of the IRE Professional Group on Information TheoryA class of multiple-error-correcting codes and the decoding scheme
840 Citations1954I.S. Reed
A class of multiple-error-correcting codes and their decoding scheme to device a coding scheme which is able to detect and correct such errors.
Bell System Technical JournalA Class of Binary Signaling Alphabets
195 Citations1956D. Slepian
A class of binary signaling alphabets called “group alphABets” is described, which are generalizations of Hamming's error correcting codes and possess the following special features: all letters are treated alike in transmission; the encoding is simple to instrument; maximum likelihood detection is relatively simple to Instrument.
IEEE Transactions on Information TheoryA note off two binary signaling alphabets
88 Citations1956D. Slepian
A generalization of Hamming's single error correcting codes is given along with a simple maximum likelihood detection scheme for Reed-Muller alphabets and a new detection scheme is presented for them.