Hamming bound Created 2026-09-24 Updated 2026-09-24
A binary length- code of size and distance at least satisfies
Equality means the code is perfect.
Parity extension Created 2026-09-24 Updated 2026-09-24
Appending a parity bit makes every word even-weight. A binary code becomes an code, where
Cyclic code Created 2026-09-24 Updated 2026-11-05
A length- cyclic code over is an ideal of . It is generated by a monic divisor of .
Linear code Created 2026-09-24 Updated 2026-11-05
A linear code over a finite field is a linear subspace . Its parameters record word length, dimension, and minimum Hamming distance. For a nonzero code, is the least Hamming weight of a nonzero word, because the difference of two words is another word.
For example, is a binary code, the kernel of the parity-check matrix . Linearity lets a generator matrix encode messages and lets the parity-check syndrome detect corruption. The zero code needs a separate convention for its minimum distance, since it has no nonzero word.
Linear-feedback shift register Created 2026-09-24 Updated 2026-11-05
A binary linear-feedback shift register of degree updates a -bit state by shifting and inserting a fixed linear combination over . With recurrence
its feedback polynomial is .
Discrete memoryless channel Created 2026-09-24 Updated 2026-10-14
A discrete memoryless channel models transmission through finite input and output alphabets using fixed conditional probabilities . For each input , these nonnegative numbers sum to one over the output symbols. Discrete refers to the symbols, and memoryless means that the noise of one use does not remember earlier uses.
For a fixed input word sent without feedback, the output law is
This is conditional independence of the outputs given the prescribed input word. It does not require an encoder to choose independent input symbols: the codewords of a block code deliberately impose relationships among them. Those relationships let a decoder distinguish possible messages after noise.
The binary symmetric channel and binary erasure channel make two different memoryless noise models with a binary input. One hides flipped bits; the other marks missing bits. Their different channel capacities show why the whole transition matrix matters, as the flips versus erasures in a binary channel demonstrate.
One-time pad Created 2026-09-24 Updated 2026-10-14
For messages in a finite additive group, a one-time pad encrypts as , where the key is uniform and independent of , as long as the message, and never reused. Then is uniform and independent of , giving perfect secrecy.
Binary block code Created 2026-09-24 Updated 2026-10-14
A binary code is a set of distinct words in whose minimum pairwise Hamming distance is . Here is the block length and is the number of codewords.
Neyman allocation Created 2026-09-24 Updated 2026-11-05
Neyman allocation minimizes the variance of an estimate for a fixed total sampling budget when group variances may differ. For independent observations in two treatment groups, estimate their mean difference by . With outcome standard deviations and fixed total , its variance is . Differentiation, or Cauchy-Schwarz inequality, gives
The noisier group receives more observations. If , the allocation ratio is rather than ; integer group sizes require rounding. Equal per-observation costs and a mean-difference estimand are part of this calculation.
For a stratified population mean , the corresponding fixed-count rule is . This additional population weight explains why assigning every stratum in proportion to its standard deviation alone is generally incorrect. Unequal costs, minimum group sizes and unknown variances alter the optimization.
Noether current Created 2026-09-24 Updated 2026-11-05
A continuous variational symmetry gives a current satisfying on shell. Integrating over space gives a conserved charge when boundary flux vanishes.
Lagrangian density Created 2026-09-24 Updated 2026-11-05
A Lagrangian density assigns a local action contribution to field values and their derivatives. Integrating over spacetime gives . For a real scalar in flat spacetime with signature , a simple density is .
Varying the field gives , illustrating how the density encodes propagation and forces. Continuous symmetries yield Noether currents under the appropriate variational assumptions. The Lagrangian density is not generally the energy density: temporal and spatial derivative terms combine differently in the Hamiltonian. Adding a total derivative leaves the bulk equations unchanged under compatible boundary conditions, though boundary contributions and canonical expressions can change.
Mean radius of a circular Coulomb bound state Created 2026-09-24 Updated 2026-09-24
For , the radial probability density is proportional to and
Second Chern form Created 2026-09-24 Updated 2026-11-05
For a unitary connection with Skew-Hermitian curvature form , use the total Chern class convention . Its degree-four part, the Second Chern form, is
Indeed, the quadratic term of is ; substituting proves the formula, since two-forms commute in the wedge product.
For an principal connection, , reducing this to . Without that tracelessness condition the trace-square term alone is generally not the Second Chern form. For a line bundle, the two terms cancel, as they must because its second Chern class vanishes.
Chemotactic pattern-forming instability Created 2026-09-24 Updated 2026-11-05
A chemotactic pattern-forming instability occurs when cells produce an attractant and drift up its gradient strongly enough that positive aggregation feedback overcomes diffusion and turnover at a finite wavelength.
Damped cyclotron motion Created 2026-09-24 Updated 2026-11-05
Damped cyclotron motion combines magnetic deflection with a dissipative force. For a nonrelativistic particle in a uniform magnetic field and linear drag , its perpendicular velocity rotates at the signed cyclotron rate while its magnitude decays as .
The Lorentz force does no work; the drag removes kinetic energy. Integrating the decaying rotating velocity gives a spiral approaching a limiting position. Motion parallel to the field decays without magnetic rotation. This model helps distinguish changing curvature caused by energy loss from changing field strength, but assumes constant mass, drag coefficient and applied field.
Centre-manifold invariance equation Created 2026-09-24 Updated 2026-09-24
If a centre manifold is the graph for and , its coefficients satisfy .
Extended centre manifold for a parameter Created 2026-09-24 Updated 2026-10-14
Appending turns a system parameter into a centre variable, allowing one invariant graph to describe nearby parameter values.
Reduced mass Created 2026-09-24 Updated 2026-10-14
The reduced mass is the effective mass for the two-particle relative coordinate of two bodies with constant positive masses :
Both bodies can respond to their mutual force, so their relative acceleration is greater than if one were fixed. Consequently . This explains why using either individual mass, or their sum, generally gives the wrong internal oscillation rate. The same reduced mass describes a two-body problem, a free two-mass spring, and the approximate molecular vibration of a diatomic molecule.[ref]
For equal masses , . Two bodies therefore have : in their stationary centre of mass frame a relative speed means individual speeds and total kinetic energy . With and , instead . At the same relative speed, the individual speeds are and , and the total kinetic energy is . These are calculations for stipulated masses and velocities.
For fixed and , . The heavy-partner limit gives from below; the relative error incurred by replacing with is . At this is . Treating the heavy body as fixed is thus a controlled approximation to internal motion, rather than an exact consequence of its being heavier.
Center-of-mass motion Created 2026-09-24 Updated 2026-10-06
The center of mass moves as if the total external force acted on the total mass; internal forces cancel in its equation.

There are unlisted articles, also show them or only show them.