Channel capacity of (O, G/l) codes

M. Stefanović, B. V. Vasić

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


The tables of channel capacities of the (0, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Icr, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.

Original languageEnglish (US)
Pages (from-to)243-245
Number of pages3
JournalElectronics Letters
Issue number2
StatePublished - Jan 1993


  • Codes and coding
  • Digital communication systems
  • Partial response signalling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Channel capacity of (O, G/l) codes'. Together they form a unique fingerprint.

Cite this