Saved in:
Bibliographic Details
Main Author: Kumar, Ravin
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.15099
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915559238533120
author Kumar, Ravin
author_facet Kumar, Ravin
contents This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal number to be represented uniquely and using the same number of bits, $n$, as the binary encoding. Theoretical foundations and mathematical formulations demonstrate that ABR can encode the same integer range as binary, validating its potential as a viable alternative. Additionally, the ABR number system is compatible with existing data compression algorithms like Huffman coding and arithmetic coding, as well as error detection and correction mechanisms such as Hamming codes. We further explore practical applications, including digital steganography, to illustrate the utility of ABR in information theory and digital encoding, suggesting that the ABR number system could inspire new approaches in digital data representation and computational design.
format Preprint
id arxiv_https___arxiv_org_abs_2510_15099
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Adaptive Base Representation Theorem: An Alternative to Binary Number System
Kumar, Ravin
Information Theory
This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal number to be represented uniquely and using the same number of bits, $n$, as the binary encoding. Theoretical foundations and mathematical formulations demonstrate that ABR can encode the same integer range as binary, validating its potential as a viable alternative. Additionally, the ABR number system is compatible with existing data compression algorithms like Huffman coding and arithmetic coding, as well as error detection and correction mechanisms such as Hamming codes. We further explore practical applications, including digital steganography, to illustrate the utility of ABR in information theory and digital encoding, suggesting that the ABR number system could inspire new approaches in digital data representation and computational design.
title Adaptive Base Representation Theorem: An Alternative to Binary Number System
topic Information Theory
url https://arxiv.org/abs/2510.15099