One-hot code 


Also known as an \(1\)-in-\(n\) code. A length-\(n\) binary code whose codewords are those with Hamming weight one. The reverse of this code, where all codewords have Hamming weight \(n-1\) is called a one-cold code.


The bi-quinary code, a combination of one-hot 1-in-2 and 1-in-5 one-hot codes to encode decimal digits, was used in several early computers ([1], Ch. 27).Marking the state of a finite automaton [2].Used in machine-learning based classification tasks because one-hot encodings, as opposed to integer encodings, do not presume an order [3].




Encyclopedia of Computer Science and Technology, Second Edition Volume I (CRC Press, 2017) DOI
S. Devadas and A. R. Newton, “Decomposition and factorization of sequential finite state machines”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8, 1206 (1989) DOI
K. Potdar, T. S., and C. D., “A Comparative Study of Categorical Variable Encoding Techniques for Neural Network Classifiers”, International Journal of Computer Applications 175, 7 (2017) DOI
Page edit log

Your contribution is welcome!

on (edit & pull request)

edit on this site

Zoo Code ID: one_hot

Cite as:
“One-hot code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022.
  title={One-hot code},
  booktitle={The Error Correction Zoo},
  editor={Albert, Victor V. and Faist, Philippe},
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:

Cite as:

“One-hot code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022.