Login / Signup

Some comments on the generalized Shannon lower bound for stationary finite-alphabet sources with memory (Corresp.).

Kung YaoHarry H. Tan
Published in: IEEE Trans. Inf. Theory (1973)
Keyphrases
  • lower bound
  • finite alphabet
  • upper bound
  • branch and bound algorithm
  • branch and bound
  • objective function
  • np hard
  • main memory
  • information theory
  • optimal solution
  • worst case
  • edit operations
  • pairwise
  • vector space