COMBINATORIAL PROPERTIES OF VARIABLELENGTH, ERROR-CORRECTING CODES,

Abstract

The two theories of variable length codes and of errorcorrecting block codes are unified by extending many of their notions and results to suitably defined variablelength, error-correcting codes. The three principal notions studied are: (1) e -correcting codes, their relation with distance and McMillan inequality, (ocorrecting = uniquely decipherable); (2) e -dense codes and their relations to various maximality properties studied in the literature; (3) e -exhaustive codes as the extension of Huffman's codes (e = o) and of closedpacked (block) codes. Various constructions and a test for error-correcting codes are given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1964
Accession Number
AD0612633

Entities

People

  • L. Calabi

Tags

DTIC Thesaurus Topics

  • Construction
  • Inequalities
  • Literature

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Graph Algorithms and Convex Optimization.