相关论文: Trellis-Coded Quantization Based on Maximum-Hammin…

Classical visual coding and Multimodal Large Language Model (MLLM) token technology share the core objective - maximizing information fidelity while minimizing computational cost. Therefore, this paper reexamines MLLM token technology,…

Double Toeplitz (shortly DT) codes are introduced here as a generalization of double circulant codes. We show that such a code is isodual, hence formally self-dual. Self-dual DT codes are characterized as double circulant or double…

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming…

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…

The number-theoretic codes are a class of codes defined by single or multiple congruences and are mainly used for correcting insertion and deletion errors. Since the number-theoretic codes are generally non-linear, the analysis method for…

We propose to use the concept of the Hamming bound to derive the optimal criteria for learning hash codes with a deep network. In particular, when the number of binary hash codes (typically the number of image categories) and code length…

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces…

In large scale distributed linear transform problems, coded computation plays an important role to effectively deal with "stragglers" (distributed computations that may get delayed due to few slow or faulty processors). We propose a coded…

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

This paper presents a comprehensive guide to designing minimal trellises for both non-degenerate and degenerate decoding of quantum stabilizer codes. For non-degenerate decoding, various strategies are explored, leveraging insights from…

We present a powerful new loss function and training scheme for learning binary hash codes with any differentiable model and similarity function. Our loss function improves over prior methods by using log likelihood loss on top of an…

In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…

A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…

Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does…

An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum…

Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

A novel search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing the depth-first search combined with the computation of coset leaders weight tables and sufficient…