Results 121 to 130 of about 159,834 (164)
A dataset for human-written and AI-generated code source classification. [PDF]
Data BriefBoukili G, Garouani SE, Riffi J.
europepmc +1 more source
Color-tunable ultralong room temperature afterglow in a wide excitation range from ultraviolet to visible light <i>via</i> doping boric acid with polyaromatic hydrocarbons. [PDF]
Chem SciYan S +5 more
europepmc +1 more source
Preservation vs. Resection? Pediatric and Non-Pediatric Management Patterns in Ovarian Torsion. [PDF]
Pediatr RepFeng X +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the covering radius of subcodes of a code
IEEE Transactions on Information Theory, 1991Summary: Let \(C\) be a binary linear code with covering radius \(R\), and \(C_ 0\) a subcode of \(C\) of codimension \(i\). An upper bound is obtained for the covering radius of \(C_ 0\) in terms of \(R\) and \(i\). When \(C_ 0=\{0\}\), the bound becomes the sphere covering bound for \(R\).
exaly +2 more sources
Covering Submonoids and Covering Codes
J. Autom. Lang. Comb., 1999This paper deals with the formalization of the intuitive notion of covering monoid and the investigation of the related algebraic properties. It is shown that covering monoids can be regarded as a generalization of the well known classical monoids and z-monoids. A new coding notion is introduced and a simple method to decide whether a finite set $X$ of
MADONIA, Maria Serafina +2 more
openaire +3 more sources
Theory of Computing Systems, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moti Frances, Ami Litman
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moti Frances, Ami Litman
openaire +2 more sources
Discrete Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Östergård, Patric R.J. +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Östergård, Patric R.J. +2 more
openaire +1 more source
IEEE Transactions on Information Theory, 2006
Summary: A code \(C\subseteq \mathbb Z_n^2\), where \(\mathbb Z^2=\{0,1\}\), has unidirectional covering radius \(R\) if \(R\) is the smallest integer so that any word in \(\mathbb Z_n^2\) can be obtained from at least one codeword \(c\in C\) by replacing either 1's by 0's in at most \(R\) coordinates or 0's by 1's in at most \(R\) coordinates.
Patric R. J. Östergård +1 more
openaire +2 more sources
Summary: A code \(C\subseteq \mathbb Z_n^2\), where \(\mathbb Z^2=\{0,1\}\), has unidirectional covering radius \(R\) if \(R\) is the smallest integer so that any word in \(\mathbb Z_n^2\) can be obtained from at least one codeword \(c\in C\) by replacing either 1's by 0's in at most \(R\) coordinates or 0's by 1's in at most \(R\) coordinates.
Patric R. J. Östergård +1 more
openaire +2 more sources
On the covering radius of codes
IEEE Transactions on Information Theory, 1985A number of new results for the minimum covering radius of any binary code of a given length and dimension are given. The minimum covering radius for codes of dimension 4 or 5 is determined exactly, and tight bounds are obtained for any dimension when the code length is large.
Ronald L. Graham, Neil J. A. Sloane
openaire +1 more source