Related papers: Codes induced by alternative codes
Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space…
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is…
Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…
Paterson, Stinson and Wei \cite{PSW} introduced Combinatorial batch codes, which are combinatorial description of Batch code. Batch codes were first presented by Ishai, Kushilevita, Ostrovsky and Sahai \cite{IKOS} in STOC'04. In this paper…
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding,…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combine two features: 1) a special type of interfaces; and 2)…
We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
Matrix Code gives imperative programming a mathematical semantics and heuristic power comparable in quality to functional and logic programming. A program in Matrix Code is developed incrementally from a specification in pre/post-condition…
As the second book in the Anyone Can Code series, Algorithmic Thinking focuses on the logic behind computer programming and software design. With a data-centred approach, it starts with simple algorithms that work on simple data items and…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes.…
A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…
In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…
We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…
We prove algebraic and combinatorial characterizations of the class of inductively pierced codes, resolving a conjecture of Gross, Obatake, and Youngs. Starting from an algebraic invariant of a code called its canonical form, we explain how…
A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform.…