Abstract

Two channels are considered; a discrete channel which can transmit sequences of binary digits, and a continuous channel which can transmit band limited signals. The performance of a large number of simple signalling alphabets is computed and it is concluded that one cannot signal at rates near the channel capacity without using very complicated, alphabets.

Keywords

SignallingChannel (broadcasting)Simple (philosophy)SIGNAL (programming language)Binary numberChannel capacityComputer scienceTopology (electrical circuits)AlgorithmMathematicsTelecommunicationsArithmeticCombinatorics

Related Publications

A Class of Binary Signaling Alphabets

A class of binary signaling alphabets called “group alphabets” is described. The alphabets are generalizations of Hamming's error correcting codes and possess the following spec...

1956 Bell System Technical Journal 195 citations

Low-density parity-check codes

A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....

1962 IEEE Transactions on Information Theory 10397 citations

Channel coding with multilevel/phase signals

A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel...

1982 IEEE Transactions on Information Theory 3729 citations

Publication Info

Year
1952
Type
article
Volume
31
Issue
3
Pages
504-522
Citations
529
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

529
OpenAlex

Cite This

E. N. Gilbert (1952). A Comparison of Signalling Alphabets. Bell System Technical Journal , 31 (3) , 504-522. https://doi.org/10.1002/j.1538-7305.1952.tb01393.x

Identifiers

DOI
10.1002/j.1538-7305.1952.tb01393.x