One-hot code[1] 

Also known as One-vs-all (OVA) code, One-against-all (1AA) code, One-vs-rest (OvR) code, \(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 ([2], Ch. 27).Marking the state of a finite automaton [3].




Nilsson, Nils J. "Learning machines." (1965).
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
L. Rokach, Pattern Classification Using Ensemble Methods (WORLD SCIENTIFIC, 2009) DOI
G. Anthony, H. Gregg, and M. Tshilidzi, “Image Classification Using SVMs: One-against-One Vs One-against-All”, (2007) arXiv:0711.2914
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
W. Utschick and W. Weichselberger, “Stochastic Organization of Output Codes in Multiclass Learning Problems”, Neural Computation 13, 1065 (2001) DOI
Page edit log

Your contribution is welcome!

on (edit & pull request)— see instructions

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.
@incollection{eczoo_one_hot, title={One-hot code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:

Cite as:

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