Extending the classical theory of two-dimensional cyclic codes, we develop an algebraic approach to bivariate bicycle codes. Using Frobenius-orbit idempotents, formulas for logical dimensions are derived and lower bounds on minimum distances are established. A systematic theory of code symmetries is formulated to construct a structured block-monomial subgroup of coordinate permutations. Several explicit examples show how to generate these codes from first principles without relying on numerical searches. An appendix extends the analysis to BCH-based product constructions.
Extending the classical theory of two-dimensional cyclic codes, we develop an algebraic approach to bivariate bicycle codes. Using Frobenius-orbit idempotents, formulas for logical dimensions are derived and lower bounds on minimum distances are established. A systematic theory of code symmetries is formulated to construct a structured block-monomial subgroup of coordinate permutations. Several explicit examples show how to generate these codes from first principles without relying on numerical searches. An appendix extends the analysis to BCH-based product constructions.
We study a weighted-shift formulation of bivariate bicycle group-algebra (BBGA) codes over finite group algebras. One binary shift acts by right multiplication and the other by left multiplication; associativity ensures that these shifts commute even for a nonabelian seed group. Bivariate polynomials in the shifts, including mixed monomials, therefore define CSS codes. We give explicit sparsity bounds and distinguish nonabelian seed groups from codes that are intrinsically inequivalent to abelian realizations. For D3, a pair of weighted permutation shifts generates a regular C6×C12 action and recovers the known [[144,12,12]] and [[144,14,14]] bivariate bicycle codes. We also present a computer-verified [[144,16,12]] code over A4×C6, with every check of weight eight. This example belongs to the established nonabelian two-block group-algebra family. Exhaustive low-weight enumeration and an intrinsic stabilizer-support invariant certify that it is inequivalent to any ordinary abelian BB or two-block group-algebra realization, even under qubit permutations combined with local Clifford operations. Finally, a nonuniform weighted-shift construction over F2[C3] yields a [[18,4,3]] code with check weights six and eight. An exact enumeration of its minimum stabilizer supports rules out every ordinary binary 2BGA realization at that length, under the same equivalence. This establishes that the unrestricted weighted-shift formulation extends beyond the ordinary 2BGA class, even with an abelian seed group.
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read from the defining polynomials. We study the Z-logical quotient K/S over F2[x,y]/(xℓ−1,ym−1) and show that it fits into a short exact sequence with an annihilator quotient as kernel and a colon quotient as cokernel. The sequence gives an explicit logical basis, a dimension formula, and a componentwise distance identity dZ=min(dA,dC). Using the Frobenius structure of the finite group algebra, we prove rA=rC=k/2 for every BB code, including repeated-root cases. The algebraic component of a logical class is distinct from the support shape of its lightest representatives: an annihilator class can have a lighter two-block representative, and a colon class can have a one-sided minimum. For lower bounds we show that every proper subset of a minimum-weight logical operator has nonzero syndrome, and that this property persists inside the colon component but not inside the annihilator component. A translation-anchored cluster search built on it proves the distances 4,6,10,10,12,18 of the six standard BB codes of lengths 18 to 288 and enumerates every minimum-weight logical operator. The resulting census shows that [[108,8,10]] is the only one of the six whose distance is attained in a single component, with dC=10 and dA=12.
We relate the properties of bivariate-bicycle-surface (BBS) codes, constructed from a pair of bivariate polynomials over a finite field, to the number and location of their common roots in the extension field. The number of roots (x,y) with finite, non-zero coordinates -- counted with algebraic multiplicity -- determines the dimension of the codes. This dimension is invariant under monomial automorphisms of the Laurent polynomial ring. Conversely, roots with zero or infinite x- or y-coordinates indicate that specialized generators are required near the corresponding boundary (e.g., the left or right boundary for a root where x is zero or infinite, respectively). These roots can appear or disappear under monomial transformations, which reveals the structure of tilted boundaries. Based on these results, we formulate a prescription for constructing BBS codes that works for regions with rectangular, diagonal, and arbitrarily tilted boundaries. A key advantage of this approach is that no corner corrections are needed, provided the polynomials satisfy orientation-specific edge conditions.
We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices. Finally, simulation results for short- to medium-length UB codes (block lengths ranging from a few hundred to approximately 103) demonstrate competitive performance relative to existing GB and bivariate bicycle (BB) codes despite the additional algebraic restriction.
We show that given an instance of a bivariate bicycle (BB) code, it is possible to generate an infinite sequence of new BB codes using increasingly large covering graphs of the original code's Tanner graph. When a BB code has a Tanner graph that is a h-fold covering of the base BB code's Tanner graph, we refer to it as a h-\textit{cover code}. We show that for a BB code to be a h-cover code, its lattice parameters and defining polynomials must satisfy simple algebraic conditions relative to those of the base code. By extending the graph covering map to a chain map, we show there are induced projection and lifting maps on (co)homology that enable the projection and lifting of logical operators and, in certain cases, automorphisms between the base and the cover code. The search space of cover codes is considerably reduced compared to the full space of possible polynomials and we find that many interesting examples of BB codes, such as the [[144,12,12]] gross code, can be viewed as cover codes. We also apply our method to search for BB codes with weight 8 checks and find many new codes, including a [[64,14,8]] and [[144,14,14]] code. For an h-cover code of an [[n,k,d]] BB code with parameters [[nh=hn,kh,dh]], we prove that kh≥k for any h, and dh≤hd when h is odd. Furthermore if h is odd and kh=k, we prove the distance lower bound d≤dh. We conjecture it is always true that an h-cover BB code of a base [[n,k,d]] BB code obeys the distance bounds d≤dh≤hd. While the focus of this work is on bivariate bicycle codes, we expect these methods to generalise readily to many group algebra codes and to certain code constructions involving hypergraph, lifted, and balanced products.
Bivariate bicycle (BB) codes of Bravyi \emph{et al.}~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-6 checks, exemplified by [[144,12,12]] with kd2/n=12. We develop the algebraic structure theory of BB-type codes with weight-8 checks (weight-4 generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula k=2dimR/(A,B) (forcing even k), a 4ℓm-element symmetry group on generator pairs, an X/Z distance equality dX=dZ, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At n=144 the pipeline returns a census of 53 codes whose strongest members surpass the BB benchmark: [[144,6,d≥15]] exceeds the benchmark distance 12 (certified d≥15), [[144,10,12]] reaches it with weight-8 checks, and [[144,16,10]] encodes a third more logical qubits at kd2/n=11.11 (7.4% below benchmark) while decoding no worse. At n=72, [[72,14,8]] attains kd2/n=12.44---more than twice the same-length BB code---and decodes better; a circuit-level memory experiment places our weight-8 codes at ≈0.1% pseudo-threshold versus ≈0.4% for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.