Related papers: Generalized Weight Structure of Polar Codes: Selec…
By inserting interleavers between intermediate stages of the polar encoder, a new class of polar codes, termed interleaved polar (i-polar) codes, is proposed. By the uniform interleaver assumption, we derive the weight enumerating function…
Motivated by the classical comatrix coalgebra, we introduce the concept of a Newtonian comatrix coalgebra. We construct an infinitesimal unitary bialgebra on a matrix algebra and a weighted infinitesimal unitary bialgebra on a…
We show that permutation weights, which are previously introduced for finite Lie algebras, can be appropriately defined also for affine Lie algebras. This allows us to classify all the weights of an affine Weyl orbit explicitly. Let…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive…
Pre-transformed polar codes (PTPCs) form a class of codes that perform close to the finite-length capacity bounds. The minimum distance and the number of minimum weight codewords are two decisive properties for their performance. In this…
This paper proposes a polar code construction scheme that reduces constituent-code supplemented decoding latency. Constituent codes are the sub-codewords with specific patterns. They are used to accelerate the successive cancellation…
Polar weighted homogeneous polynomials are the class of special polynomials of real variables $x_i,y_i, i=1,..., n$ with $z_i=x_i+\sqrt{-1} y_i$, which enjoys a "polar action". In many aspects, their behavior looks like that of complex…
In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with…
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants…
Consider the weight $\lambda$ which is the sum of all simple roots of a simple Lie algebra. Using Kostant's weight multiplicity formula we describe and enumerate the contributing terms to the multiplicity of the zero weight in the…
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
For the weight function $W_\mu(x) = (1-|x|^2)^\mu$, $\mu > -1$, $\lambda > 0$ and $b_\mu$ a normalizing constant, a family of mutually orthogonal polynomials on the unit ball with respect to the inner product $$ \la f,g \ra = {b_\mu…
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
The present paper has been motivated by an aspiration for understanding the weight system corresponding to the Lie algebra $\mathfrak{gl}_N$. The straightforward approach to computing the values of a Lie algebra weight system on a general…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…