# One-hot code

## Description

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.

## Realizations

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].

## Parents

## References

- [1]
- Encyclopedia of Computer Science and Technology, Second Edition Volume I (CRC Press, 2017). DOI
- [2]
- 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
- [3]
- 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

## Zoo code information

## Cite as:

“One-hot code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/one_hot

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/classical/bits/easy/one_hot.yml.