In coding theory, a Tanner graph
is a means of dealing with error correcting codes. Nodes on the graph are of two types: digit and subcode. For a simple linear code, the subcode nodes represent rows of the parity check matrix. Mao et al
consider the utility of such graphs and their duality, as a kind of Fourier transform duality.
The diagram shows two Tanner graphs: the first a multiplicative graph for the $(7,4)$ Hamming code and the second a convolution graph for the dual code. The $+$ bits denote the single bit parity check. Observe how similar the placing of these bits is to the Time vertices of the Space-Time hexagon. The full Hamming code generator matrix is then a $(7,1)$ matrix, with the $7 \times 7$ circulant spatial part.
I am now reading this article
on the triality of a Hamming code VOA. This paper embeds the Hamming code operad into the $D_4$ one so that the $D_4$ triality (which appears in the graviweak sector of Garrett's work
as the generation structure) restricts to the triality that permutes the mutually orthogonal conformal vectors for the Hamming code.
In his book
, Quantum Fluctuations of Spacetime
, L. B. Crowell discusses the Hamming code in the context of a Galois field representation associated to General Relativity. That is, the parallel transport of a spacetime vector in a finite element analysis is expressed in terms of field extensions associated to sets of points.