Results 11 to 20 of about 764,565 (289)
New classes of few-weight ternary codes from simplicial complexes
AIMS Mathematics, 2022 In this article, we describe two classes of few-weight ternary codes, compute their minimum weight and weight distribution from mathematical objects called simplicial complexes.
Yang Pan , Yan Liu
doaj +1 more source
Optimal Narain CFTs from codes
Journal of High Energy Physics, 2022 Recently established connection between additive codes and Narain CFTs provides a new tool to construct theories with special properties and solve modular bootstrap constraints by reducing them to algebraic identities.
Nikolaos Angelinos +2 more
doaj +1 more source
BVPs Codes for Solving Optimal Control Problems
Mathematics, 2021 Optimal control problems arise in many applications and need suitable numerical methods to obtain a solution. The indirect methods are an interesting class of methods based on the Pontryagin’s minimum principle that generates Hamiltonian Boundary Value ...
Francesca Mazzia, Giuseppina Settanni
doaj +1 more source
Constant-Weight Gray Codes for Local Rank Modulation [PDF]
, 2010 We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations.
Eyal En Gad +4 more
core +4 more sources
A Framework of Constructions of Minimal Storage Regenerating Codes with the Optimal Access/Update Property [PDF]
, 2015 In this paper, we present a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes based on the invariant subspace technique.
Li, Jie, Parampalli, Udaya, Tang, Xiaohu
core +1 more source
Weight distributions for projective binary linear codes from Weil sums
AIMS Mathematics, 2021 A class of projective binary linear codes are constructed and their weight distributions are investigated using Weil sums. They have at most three nonzero weights, containing some optimal codes.
Shudi Yang, Zheng-An Yao
doaj +1 more source
, 2021 This article shows that any type of binary data can be defined as a collection from codewords of variable length. This feature helps us to define an Injective and surjective function from the suggested codewords to the required codewords. Therefore, by replacing the new codewords, the binary data becomes another binary data regarding the intended goals.
Gharehbagheri, Parviz +3 more
openaire +2 more sources
Optimal Locally Repairable Codes for Parallel Reading
IEEE Access, 2020 Locally repairable codes (LRCs) have important applications in distributed storage systems. In this paper, we study q-ary [n, k, d] LRCs with (r, t, δ)-information-locality, where each of the i-th (1 ≤ i ≤ k) information symbol is ...
Jie Hao +3 more
doaj +1 more source
QPSK Block-Modulation Codes for Unequal Error Protection [PDF]
, 1995 Unequal error protection (UEP) codes find applications in broadcast channels, as well as in other digital communication systems, where messages have different degrees of importance.
Lin, Shu, Morelos-Zaragoza, Robert H
core +2 more sources