Even code¶

A binary linear code in which every codeword has even Hamming weight; it is doubly even when all weights are divisible by four and strictly even when even but not doubly even.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9328
Domain group: Formal Sciences
Origin domain: Information Theory
Subdomains: Coding Theory, Binary Linear Codes → Information Theory

Core Idea¶

An even code is a binary linear code all of whose codewords have even Hamming weight. Because the code is linear, the condition can be checked on a generating set: sums of even-weight generators remain even. Equivalently, every codeword is orthogonal over F₂ to the all-ones vector, so the code lies inside the even-weight subspace.

For a binary cyclic code, evenness corresponds to the generator polynomial having x+1 as a factor under the usual polynomial representation. This statement should not be applied to noncyclic codes. A code is doubly even when every weight is divisible by four; if it is even but contains a word of weight congruent to two modulo four, it is strictly even. The extended binary Hamming code of length 8 and extended binary Golay code of length 24 are prominent doubly even, self-dual examples.

Structural Signature¶

Sig role-phrases:

binary linear code. Supplies a vector subspace of binary words of fixed block length. Constitutive carrier. If altered: A nonlinear set of even-weight words needs a broader label.
codeword Hamming weight. Counts nonzero coordinates in each word. Constitutive measured property. If altered: Symbol sum over another alphabet is a different condition.
even-parity invariant. Requires every codeword's weight to be divisible by two. Identity-bearing rule. If altered: One odd-weight codeword defeats evenness.
generator or parity characterization. Uses row parity, all-ones orthogonality, or for cyclic codes an x+1 factor. Central recognition tool. If altered: The polynomial statement requires a cyclic-code setting.
four-divisibility refinement. Separates doubly even from strictly even codes. Necessary subtype boundary. If altered: Evenness alone does not imply weight divisible by four.

What It Is Not¶

Even block length. Are codeword weights even?
Parity-check code. Is the full even-weight subspace or a subcode meant?
Doubly even code. Are weights divisible by four?
Self-dual code. Is parity being inferred without proof?

Scope of Application¶

Use even code with binary field, block length, linear code or generator matrix, weight definition, proof of parity, cyclic-polynomial convention if relevant, and strictly/doubly even subtype stated.

Coding theory. Classifies binary linear codes.
Error detection. Uses parity constraints.
Self-dual codes. Studies weight divisibility.
Lattice constructions. Relates doubly even codes to lattices.
Combinatorics. Studies weight enumerators.

Clarity¶

Evenness is a global condition over all codewords but linearity reduces checking to generators. That shortcut fails for arbitrary nonlinear code sets.

Manages Complexity¶

Weight divisibility by four adds structure not captured by parity and interacts strongly with self-duality, weight enumerators, and lattice constructions.

Abstract Reasoning¶

Verify binary linear-code structure.
Compute weights of a generating basis.
Confirm every generator has even parity.
For cyclic codes, reconcile with the x+1 factor.
Check modulo-four weights to classify strict or double evenness.

Knowledge Transfer¶

Divisibility constraints on word weights transfer to lattices and designs, but binary linear-code structure delimits even codes. The nearest stopping boundary is explicit: A single-parity-check code is closest and is itself the full even-weight code, while an arbitrary even code can be any linear subcode of it. The inclusion test remains: A binary linear code is even when every vector in the code has an even number of ones. The structure no longer applies when the case exits when one codeword has odd Hamming weight or the object is not a binary linear code under the stated identity.

Examples¶

Canonical¶

A generator matrix has only even-weight rows; every binary linear combination also has even weight, so its row-space code is even.

Mapped back: binary linear code → row space over F2; codeword Hamming weight → number of ones; even-parity invariant → generator rows even; generator or parity characterization → basis check; four-divisibility refinement → tested separately.

Applied / In Practice¶

A binary code contains weights 0, 4, 6, and 8. It is even, but the weight-6 word prevents it from being doubly even, so it is strictly even.

Mapped back: binary linear code → declared linear code; codeword Hamming weight → 0,4,6,8; even-parity invariant → all even; generator or parity characterization → satisfied; four-divisibility refinement → fails at 6.

Structural Tensions¶

T1: all-word property vs. generator shortcut. Linearity makes a global condition checkable from a basis. Diagnostic: Is linearity established?

T2: even parity vs. four-divisibility. Both sound similar while supporting different theorems. Diagnostic: Does any weight equal two modulo four?

Structural–Framed Character¶

Description turns on binary linear code, codeword Hamming weight, even-parity invariant, generator or parity characterization, four-divisibility refinement. Skeletal core. A closed family preserves a divisibility invariant under its composition operation. Domain-bound accent. Binary vectors, Hamming weight, generators, cyclic polynomials, parity, self-duality, and Golay codes define even codes. Transfer remains bounded because Why not prime. Invariant-preserving closure is portable; this is a coding-theory class. The negative boundary is concrete: Any even-length code, even-distance code, parity-check code, binary code containing some even words, doubly even lattice, self-dual code, cyclic code, or checksum is not automatically an even code. Even codes are structural-formal: binary linear closure propagates a parity invariant from generators to all words. Its character: a code space containing no odd-weight vector.

Structural Core vs. Domain Accent¶

Skeletal core. A closed family preserves a divisibility invariant under its composition operation.

Domain-bound accent. Binary vectors, Hamming weight, generators, cyclic polynomials, parity, self-duality, and Golay codes define even codes.

Why not prime. Invariant-preserving closure is portable; this is a coding-theory class.

This entry under conditions is a kind of Error-Correcting Code.

Binary linear code. It is the exact mathematical genus.
Doubly even code. It is the stronger subtype.
No strict parent is asserted.

Relationships to Other Abstractions¶

Current abstraction Even code Domain-specific

Parents (1) — more general patterns this builds on

Even code is a kind of, conditional Error-Correcting Code Domain-specific

Even-weight constraint alone guarantees parity structure and some detection; correction capability depends on the complete code's minimum distance.

Condition / exception Even-weight constraint alone guarantees parity structure and some detection; correction capability depends on the complete code's minimum distance.

Hierarchy path (1) — routes to 1 parentless root

Even code → Error-Correcting Code → Encoding And Decoding → Transformation → Function (Mapping)

Neighborhood in Abstraction Space¶

Even code sits in a moderately populated region (44^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Even block length. Tell: Are codeword weights even?
Parity-check code. Tell: Is the full even-weight subspace or a subcode meant?
Doubly even code. Tell: Are weights divisible by four?
Self-dual code. Tell: Is parity being inferred without proof?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Even_code (revision 1309161959).

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.