Skip to search formSkip to main contentSkip to account menu

Bit-length

Known as: Bit length 
Bit-length is the number of binary digits, called bits, necessary to represent an integer in the binary number system. At their most fundamental… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Analog signalBinary codeCanonical Huffman codeKey (cryptography)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Hardware implementation of real-time Extreme Learning Machine in FPGA: Analysis of precision, resource occupation and performance
2012
2012
Hardware-efficient matrix inversion algorithm for complex adaptive systems
This work shows an FPGA implementation for the matrix inversion algebra operation. Usually, large matrix dimension is required… 
2009
2009
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic… 
2008
2008
A New Blind Signature Scheme Based On Factoring and Discrete Logarithms
Blind signature scheme, an important cryptographic primitive, is useful in protocols that guarantee the anonymity of the… 
2008
2008
Error detection and concealment for video transmission using information hiding
2007
2007
A Robust GF(p) Parallel Arithmetic Unit for Public Key Cryptography
This paper presents the architecture and FPGA implementation of a robust GF(p) parallel arithmetic unit. The most efficient… 
2006
2006
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret… 
2004
2004
Effect of island geometry on the replay signal in patterned media storage
In a move to extend the storage capabilities of magnetic storage systems beyond 1 Tb/in/sup 2/, the use of patterned media has… 
2002
2002
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
Abstract Let us recall that Raphael Robinson's Arithmetic Q is an axiom system that differs from Peano Arithmetic essentially by… 
1997
1997
Dynamic operand interchange for low power
Power consumption of an execution unit can be reduced by interchanging its two input operands. A dynamic operand interchange… 
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)