相关论文: Linear tail-biting trellises: Characteristic gener…

Recently, rate-$1/\omega$ zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) with cyclic-redundancy-check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short…

Both the Bern, Carrasco and Johansson (BCJ) and the Kawai, Lewellen and Tye (KLT) double-copy formalisms have been recently generalized to a class of scattering matrix elements (so-called form factors) that involve local gauge-invariant…

In their study of characters of minimal affinizations of representations of orthogonal and symplectic Lie algebras, Chari and Greenstein conjectured that certain Jacobi-Trudi determinants satisfy an alternating sum formula. In this note, we…

An algorithm for exact maximum likelihood(ML) decoding on tail-biting trellises is presented, which exhibits very good average case behavior. An approximate variant is proposed, whose simulated performance is observed to be virtually…

The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…

We present two new algorithms for Householder QR factorization of Block Low-Rank (BLR) matrices: one that performs block-column-wise QR, and another that is based on tiled QR. We show how the block-column-wise algorithm exploits BLR…

The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of two-dimensional convolutional codes (2D CCs) and 2D tail-biting…

This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…

By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak…

Kotschick and Morita recently discovered factorisations of characteristic classes of transversally symplectic foliations that yield new characteristic classes in foliated cohomology. We describe an alternative construction of such…

We propose a program for bridging the gap between the perturbative BV-BFV quantization of Chern-Simons theory and the non-perturbative Reshetikhin-Turaev (RT) invariants of 3-manifolds, passing through factorization homology of…

Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…

This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint…

Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…

Koutras has proposed some methods to construct reducible proper conformal Killing tensors and Killing tensors (which are, in general, irreducible) when a pair of orthogonal conformal Killing vectors exist in a given space. We give the…

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…

We introduce a twisted fiber bundle construction of quantum CSS codes over group algebras \(R=\mathbb F_2[G]\), where each base generator carries a generator-dependent \(R\)-linear fiber twist satisfying a flatness condition. This…

We define three types of upper (and lower) triangular blocked tensors, which are all generalizations of the triangular blocked matrices. We study some basic properties and characterizations of these three types of triangular blocked…

A conceptual framework involving partition functions of normal factor graphs is introduced, paralleling a similar recent development by Al-Bashabsheh and Mao. The partition functions of dual normal factor graphs are shown to be a Fourier…

We conjecture that the complex of Soergel bimodules associated with the full twist braid is categorically diagonalizable, for any finite Coxeter group. This utilizes the theory of categorical diagonalization introduced earlier by the…