Ben Lynn Created 2026-10-13 Updated 2026-11-05
Author of expository notes on coding theory and number theory, including symbol codes and quadratic reciprocity. The notes connect explicit algorithms and examples with their algebraic justification.[ref]
Symbol Codes by Ben Lynn. author attribution and the named work’s subject
Binary inner product Created 2026-09-28 Updated 2026-11-05
For vectors , the binary inner product is the bilinear formIts value is the parity of the coordinates at which both vectors are one. For example, , whereas because in the finite field .
The terminology does not impose the positive definiteness axiom of a real or complex inner product. A nonzero vector can have zero self-pairing, as the second example shows. The form is nevertheless a nondegenerate bilinear form: a nonzero coordinate of is detected by pairing with the corresponding standard basis vector. This pairing defines orthogonality and dual codes in coding theory.
Finite field Created 2026-09-24 Updated 2026-10-13
A finite field is a field with finitely many elements: addition, subtraction, multiplication, and division by a nonzero element all stay inside a finite collection. Write , or , for a finite field with elements. The subscript counts elements; it does not prescribe modular arithmetic modulo . The field with four elements is the smallest example where that distinction matters.
Every finite field has size , where is a prime number and is a positive integer. To see the counting mechanism, use its prime field : the finite field is a finite-dimensional vector space over . For a basis , every element has exactly one expressionEach coefficient has choices, so there are expressions. Here is the characteristic of a field and is the dimension of a vector space. Thus sizes are possible, whereas are not prime powers and cannot be finite field sizes.
Conversely, every prime power occurs, and any two finite fields of the same size admit a field isomorphism. These are classification statements, beyond the counting argument. See Conrad's Theorems 1.5, 2.2, and 2.7.[ref]
https://kconrad.math.uconn.edu/blurbs/galoistheory/finitefields.pdf. Keith Conrad, Finite Fields, sections 1–2
Uniqueness means the arithmetic agrees after relabeling; it does not choose a basis, an irreducible polynomial for a quotient ring representation, or a particular field isomorphism. Even for the field with four elements, exchanging and preserves the arithmetic.The appeal for coding theory is exact, finite arithmetic with reliable division: polynomial interpolation and linear algebra work over a finite alphabet. A Reed-Solomon code represents messages by polynomials and adds redundancy by evaluating them at several distinct finite field elements. Forney's MIT notes develop this arithmetic as preparation for such error-correcting codes.[ref]
https://ocw.mit.edu/courses/6-451-principles-of-digital-communication-ii-spring-2005/8921c013c1d7802bb197572c52442b97_chap7.pdf. G. David Forney Jr., Introduction to finite fields, 2005
In cryptography, finite fields likewise supply exact arithmetic on finitely many symbols, with operations that can be implemented using bits.Historically, Évariste Galois published work on finite fields beyond prime fields in 1830, constructing them by adjoining elements satisfying irreducible polynomials over prime fields. Conrad's historical account also records E. H. Moore's 1893 terminology, from which the name Galois field and notation descend.[ref]
G. Eric Moorhouse 2026-11-05
G. Eric Moorhouse is a mathematician whose work includes finite geometry, incidence structures and coding theory. His author homepage identifies him as Eric Moorhouse and records a University of Wyoming faculty appointment beginning in 1989.[ref]
https://ericmoorhouse.org/. Author biographical statement
With Aart Blokhuis, he computed characteristic- rank formulas for the point-hyperplane incidence matrix of a set system in finite orthogonal geometries. Their calculations yield bounds on ovoids and rule out their existence in several families.[ref]
Some p-ranks Related to Orthogonal Spaces by Aart Blokhuis and G. Eric Moorhouse. Abstract and section 4
The link is that an incidence matrix converts containment statements into vectors over a finite field. A proposed geometric configuration must satisfy the resulting linear constraints, so linear algebra can prove that the configuration cannot exist. This makes incidence ranks useful structural information, rather than merely a numerical summary of a matrix. Venkatesan Guruswami Created 2026-10-18 Updated 2026-11-05
Venkatesan Guruswami is a computer scientist whose research includes coding theory, computational complexity theory, pseudorandomness and the complexity of approximate optimization. A major focus is list decoding of error-correcting codes.[ref]
Ordinary unique decoding aims to recover one transmitted message; list decoding permits a bounded list of candidate messages when the received word has too many errors for uniqueness. The resulting questions connect the amount of redundancy in a error-correcting code with how much corruption can be handled efficiently. His research profile also describes work on approximate solutions to problems with NP-hardness.[ref]
Venkatesan Guruswami's Berkeley research homepage. Research, list decoding with optimal redundancy and approximate solutions to NP-hard problems
Identity source: theory.cs.berkeley.edu/
Portrait of Venkatesan Guruswami
. Photograph from University of California, Berkeley's official researcher profile. Source.
