Related:

• bytesexual: /bi:t`sek'shu-*l/ adj. Said of hardware
  denotes willingness to compute or pass data in either {big-endian} or {little-endian} format (depending, presumably, on a {mode bit} somewhere)....
• NUXI problem: /nuk'see pro'bl*m/ n. Refers to the problem of transferring data between machines with differing byte-order.
  The string `UNIX' might look like `NUXI' on a machine with a different `byte sex' (e....
• little-endian: adj. Describes a computer architecture in which, within a given 16- or 32-bit word, bytes at lower addresses have lower significance (the word is stored `little-end-first').
  The PDP-11 and VAX families of computers and Intel microprocessors and a lot of communications and networking hardware are little-endian....
• wab: /swob/ [From the mnemonic for the PDP-11 `SWAp Byte' instruction, as immortalized in the `dd(1)' option `conv=swab' (see {dd})] 1.
  vt. To solve the {NUXI problem} by swapping bytes in a file....
• middle-endian: adj. Not {big-endian} or {little-endian}.
  Used of perverse byte orders such as 3-4-1-2 or 2-1-4-3, occasionally found in the packed-decimal formats of minicomputer manufacturers who shall remain nameless....
• NUXI problem /nuk'see pro'bl*m/ n. Refers to the problem of transferring data between machines with differing byte-order.
  The string `UNIX' might look like `NUXI' on a machine with a different `byte sex' (e....
• wab /swob/ [From the mnemonic for the PDP-11 `SWAp Byte' instruction, as immortalized in the dd(1) option conv=swab (see dd)] 1.
  vt. To solve the NUXI problem big-endian, little-endian, middle-endian, bytesexual....
• middle-endian adj. Not big-endian or little-endian.
  Used of perverse byte orders such as 3-4-1-2 or 2-1-4-3, occasionally found in the packed-decimal formats of minicomputer manufacturers who shall remain nameless....
• big-endian: [From Swift's "Gulliver's Travels" via the famous paper "On Holy Wars and a Plea for Peace" by Danny Cohen, USC/ISI IEN 137, dated April 1, 1980] adj.
  1. Describes a computer architecture in which, within a given multi-byte numeric representation, the most significant byte has the lowest address (the word is stored `big-end-first')....