TechRxiv
CostComplexityCoding33.pdf (648.81 kB)
Download file

Coding Complexity Cost and the Number of Bases

Download (648.81 kB)
preprint
posted on 2022-09-09, 01:46 authored by Subhash KakSubhash Kak

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. 

History

Email Address of Submitting Author

subhash.kak@okstate.edu

ORCID of Submitting Author

0000-0001-5426-9759

Submitting Author's Institution

Oklahoma State University

Submitting Author's Country

  • United States of America

Usage metrics

    Licence

    Exports