Results 41 to 50 of about 29,101,112 (306)

Combinatorial batch codes [PDF]

open access: yes, 2008
In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of [n] items among [m] devices (servers) in such a way that any [k] items can be ...
Paterson, Maura B.   +2 more
core   +4 more sources

Narain CFTs from nonbinary stabilizer codes

open access: yesJournal of High Energy Physics, 2023
We generalize the construction of Narain conformal field theories (CFTs) from qudit stabilizer codes to the construction from quantum stabilizer codes over the finite field of prime power order ( F p m $$ {\mathbbm{F}}_{p^m} $$ with p prime and m ≥ 1) or
Yasin Ferdous Alam   +4 more
doaj   +1 more source

Multiset Combinatorial Batch Codes

open access: yes, 2017
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from ...
Silberstein, Natalia   +2 more
core   +1 more source

Polyadic Constacyclic Codes

open access: yes, 2014
For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier of a Type I ...
Chen, Bocong   +3 more
core   +1 more source

On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6ps

open access: yesIEEE Access, 2020
Let $p$ be an odd prime, $s$ , $m$ be positive integers such that $p^{m}\equiv 2 \pmod 3$ . In this paper, using the relationship about Hamming distances between simple-root cyclic codes and repeated-root cyclic codes, the Hamming distance of all ...
Hai Q. Dinh   +2 more
doaj   +1 more source

Generalized Twisted Gabidulin Codes

open access: yes, 2018
Let $\mathcal{C}$ be a set of $m$ by $n$ matrices over $\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in \mathcal{C}$. Suppose that $m\leqslant n$.
Lunardon, Guglielmo   +2 more
core   +1 more source

The MedSupport Multilevel Intervention to Enhance Support for Pediatric Medication Adherence: Development and Feasibility Testing

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction We developed MedSupport, a multilevel medication adherence intervention designed to address root barriers to medication adherence. This study sought to explore the feasibility and acceptability of the MedSupport intervention strategies to support a future full‐scale randomized controlled trial.
Elizabeth G. Bouchard   +8 more
wiley   +1 more source

Construction of q-ary(n,M,d)-codes in PG(2,16)

open access: yesWasit Journal for Pure Sciences, 2023
The goal of this paper was to study the applications of the projective plane PG (2, q) over a Galois field of order q in the projective q-ary (n, M, d) -code such that the parameters length of code n, the maximum value size code M, and the minimum ...
Dunya Fareeq Fendi   +1 more
doaj   +1 more source

The Minimum Distance of Some Narrow-Sense Primitive BCH Codes

open access: yes, 2017
Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades.
Li, Shuxing
core   +1 more source

Affine m-ary gray codes

open access: yesInformation and Control, 1963
Summary: This paper presents a nontable-lookup technique for generating a class of \(n\)-dimensional \(m\)-ary Gray codes for every pair \((n,m)\) of integers. It does not seek to exhaust all such codes, but restricts itself to a class characterized by simple encoding and decoding schemes.
openaire   +2 more sources

Home - About - Disclaimer - Privacy