Jump to content

Little-endian: Difference between revisions

From Hackerpedia
imported>Unknown user
No edit summary
 
imported>Unknown user
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{LanguageHeader|en}}
{{LanguageHeader|en}}
{{CyberTerm|definition=The property of a byte string having its bytes positioned in order of increasing significance. In particular, the leftmost (first) byte is the least significant, and the rightmost (last) byte is the most significant. The term “little-endian” may also be applied in the same manner to bit strings (e.g., the 8-bit string 11010001 corresponds to the byte&nbsp;<span class="math-tex">\(2^0+2^1+2^3+2^7=139\)</span>).|source=FIPS 203}}
{{CyberTerm|definition=The property of a byte string having its bytes positioned in order of increasing significance. In particular, the leftmost (first) byte is the least significant, and the rightmost (last) byte is the most significant. The term “little-endian” may also be applied in the same manner to bit strings (e.g., the 8-bit string 11010001 corresponds to the byte&nbsp;\(2^0+2^1+2^3+2^7=139\)).|source=FIPS 203}}

Latest revision as of 00:24, 20 January 2026

Languages: English | Français

Little-endian

The property of a byte string having its bytes positioned in order of increasing significance. In particular, the leftmost (first) byte is the least significant, and the rightmost (last) byte is the most significant. The term “little-endian” may also be applied in the same manner to bit strings (e.g., the 8-bit string 11010001 corresponds to the byte \(2^0+2^1+2^3+2^7=139\)).


Source: FIPS 203 | Category: