What is Gray code, and why does it matter?

Gray code (formally 'reflected binary code') is an ordering of binary numbers where every consecutive pair differs by exactly one bit. It's used in rotary encoders, Karnaugh maps, and error-correction contexts because a single bit change can never be misread as a jump of more than one step.

Why is decimal 5 converted to Gray code 111?

5 in ordinary binary is 101. Shifting that right by one bit gives 010, and XORing 101 with 010 gives 111, which is the Gray code for 5.

How is Gray code different from plain binary?

Plain binary can change multiple bits between consecutive values (3 is 011 and 4 is 100, a 3-bit change), while Gray code guarantees exactly one bit changes between any two consecutive values, which is the whole point of the reflected binary construction.

Does this tool support negative numbers?

No, only non-negative decimal integers are accepted, since Gray code as commonly defined encodes unsigned magnitudes; there's no single standard convention for a signed Gray code.

Decimal to Gray Code Converter - Convert Integers to Reflected Binary

Overview

Introduction

Gray code is an alternative way of ordering binary numbers so that only one bit ever changes between consecutive values, which makes it valuable anywhere a physical or noisy transition between values needs to be unambiguous.

This tool converts an ordinary decimal integer directly into its Gray code representation, expressed as binary digits.

What Is Decimal to Gray Code Converter?

A converter that takes a non-negative decimal integer and produces its Gray code (reflected binary code) equivalent.

Gray code numbers look like ordinary binary digits, but the sequence is reordered so any two consecutive values differ in exactly one bit position.

How Decimal to Gray Code Converter Works

The decimal input is first parsed as a BigInt and converted conceptually to ordinary binary.

Gray code is then computed with the standard formula `gray = binary ^ (binary >> 1)`: the binary value is XORed with itself shifted one bit to the right, which is exactly the operation that guarantees a one-bit difference between consecutive integers.

When To Use Decimal to Gray Code Converter

Use it when implementing or studying rotary/absolute position encoders, Karnaugh map bit orderings, or any protocol that specifically calls for Gray-coded values.

It's also useful as a teaching tool for seeing exactly how the XOR-based Gray code formula transforms a given binary value.

Often used alongside Gray Code to Decimal Converter and Binary to Negabinary Converter.

Features

Advantages

Uses BigInt internally, so it isn't limited to 32-bit integers and can handle arbitrarily large decimal inputs.
Applies the standard, well-known Gray code formula directly, with no approximation.
Instant, deterministic, fully client-side.

Limitations

Only accepts non-negative integers; there is no single standard convention for encoding negative numbers in Gray code.
The output isn't zero-padded to a fixed width; pad it yourself if your application expects a specific bit width.

Examples

Converting decimal 5

Input

Output

5 in binary is 101; XORing 101 with itself shifted right (010) gives 111.

Converting decimal 10

Input

Output

10 in binary is 1010; XORing 1010 with itself shifted right (0101) gives 1111.

Best Practices & Notes

Best Practices

Feed the output into the Gray Code to Decimal Converter to confirm it round-trips back to your original decimal value.
Zero-pad the result yourself first if you need every Gray code value in a sequence to share the same fixed bit width.

Developer Notes

Implemented with JavaScript BigInt: `gray = value ^ (value >> BigInt(1))`, using `BigInt(1)` rather than the `1n` literal syntax since this repo's ES2017 TypeScript target doesn't support BigInt literals.

Decimal to Gray Code Converter Use Cases

Encoding position values for rotary or absolute encoders that rely on Gray code
Building or checking Karnaugh map bit orderings
Teaching how the XOR-based Gray code formula works on concrete numbers

Common Mistakes

Assuming Gray code and binary look the same for small numbers; they diverge starting at decimal 3 (binary 011, Gray code 010).
Forgetting the output isn't zero-padded, which can make consecutive Gray code values look like they have different bit widths.

Tips

Try consecutive decimal inputs (e.g. 6, 7, 8) and compare the outputs to see the one-bit-at-a-time change property in action.
Use the Gray Code to Decimal Converter to verify the encoding round-trips correctly.

Decimal to Gray Code Converter