Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Bit numbering

Known as: MSB-1, Lowest significant bit first, Bit ordering 
In computing, bit numbering (or sometimes bit endianness) is the convention used to identify the bit positions in a binary number or a container for… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
  • P. Tsai, Chung-Yi Lin
  • IEEE Transactions on Very Large Scale Integration…
  • 2011
  • Corpus ID: 35226159
This paper presents a generalized conflict-free memory addressing scheme for memory-based fast Fourier transform (FFT) processors… Expand
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Highly Cited
2009
Highly Cited
2009
The conventional modified Booth encoding (MBE) generates an irregular partial product array because of the extra partial product… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Highly Cited
2005
Highly Cited
2005
In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2004
2004
This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different… Expand
  • figure 1
  • figure 2
  • figure 3
2002
2002
Errors in parallel binary data produced by a plurality of data track, e.g., a plurality of parallel shift registers, are… Expand
Highly Cited
1999
Highly Cited
1999
Side channel cryptanalysis techniques, such as the analysis of instantaneous power consumption, have been extremely effective in… Expand
  • figure 1
Review
1997
Review
1997
The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Highly Cited
1995
Highly Cited
1995
  • G. Antoshenkov
  • Proceedings DCC '95 Data Compression Conference
  • 1995
  • Corpus ID: 55167478
Summary form only given. Bitmap compression reduces storage space and transmission time for unstructured bit sequences like in… Expand
Highly Cited
1993
Highly Cited
1993
It was shown earlier that for a punctured Reed-Muller (RM) code or a primitive BCH code, which contains a punctured RM code of… Expand
Highly Cited
1986
Highly Cited
1986
Multiattribute hashing and its variations have been proposed for partial match and range queries in the past. The main idea is… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 3
  • table 3