Skip to search formSkip to main contentSkip to account menu

Modulo-N code

Modulo-N code is a lossy compression algorithm used to compress correlated data sources using modulo arithmetic.
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
DISCUSData compressionDelta encodingLossy compression

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Pascal's Triangle Modulo n and Its Applications to Efficient Computation of Binomial Coefficients
In this thesis, Pascal’s Triangle modulo n will be explored for n prime and n a prime power. Using the results from the case when… 
2018
2018
Nonuniform Distributions of Patterns of Sequences of Primes in Prime Moduli
For positive integers q, Dirichlet’s theorem states that there are infinitely many primes in each reduced residue class modulo q… 
2014
2014
Graf cayley pada grup modulo-n (Mn)
INDONESIA : Graf cayley G = cay(Γ,S)=(V,E) adalah graf yang dibentuk dari sebuah grup Γ dengan himpunan titik V=Γ dan himpunan… 
2008
2008
On the modulo 2n+1 multiplication for diminished-1 operands
In this work we propose an enhancement to one of the most efficient modulo 2n +1 multipliers for diminished-1 operands already… 
1993
1993
Design and analysis of delay-insensitive modulo-N counters
Various delay-insensitive circuits for modulo-N counters are formally derived and analyzed. Modulo-N counters are used in many… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)