Related papers: The Narayana Universal Code
In this paper a novel approach is proposed based on single Euler number feature which is free from thinning and size normalization for multi-font and multi-size Kannada numeral recognition system. A nearest neighbor classification is used…
Progress in designing channel codes has been driven by human ingenuity and, fittingly, has been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel, represent the latest breakthrough in coding theory and have…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar…
A sequence of coefficients appearing in a recurrence for the Narayana polynomials is generalized. The coefficients are given a probabilistic interpretation in terms of beta distributed random variables. The recurrence established by M.…
Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…
When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural…
The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…
We will show how to obtain a linear code from a configuration of affine lines in general position and a suitable set of rational points. We will also explain a new decoding algorithm based on the configuration, which seems to be quite…
This paper introduces a new counting code. Its design was motivated by distributed video coding where, for decoding, error correction methods are applied to improve predictions. Those error corrections sometimes fail which results in…
In this paper, some nonbinary quantum codes using classical codes over Gaussian integers are obtained. Also, some of our quantum codes are better than or comparable with those known before, (for instance [[8; 2; 5]]4+i).
Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many…
A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…
Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
We present a novel technique for encoding and decoding constant weight binary codes that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight…
Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…
We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source $P_{X,Z}$ there exists a slightly modified polar code - having the same rate, the…
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters…
A novel tool for tsunami wave modelling is presented. This tool has the potential of being used for operational purposes: indeed, the numerical code \VOLNA is able to handle the complete life-cycle of a tsunami (generation, propagation and…