loading page

Coding Complexity Cost and the Number of Bases
  • Subhash Kak
Subhash Kak
Oklahoma State University

Corresponding Author:[email protected]

Author Profile

Abstract

The question of coding of information is connected with that of dimensionality and efficient processing in both engineered and natural systems. When the cost of coding of data or that of classes increases linearly with the number of bases, ternary coding is superior to binary, and coding in e is optimal. This paper investigates the relative efficiency of bases for the cases when the cost complexity is affine (slope-intercept linear) or exponential. The affine cases for which binary and ternary bases are optimal are presented.