Covering codes in Sierpinski graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Laurent Beaudou +4 more
doaj +4 more sources
Towards a nomenclature of health services for implementing universal health coverage in low- and middle-income countries [PDF]
Communications MedicineBackground Achieving Universal Health Coverage (UHC) in low- and middle-income countries (LMICs) requires a robust digital infrastructure capable of monitoring healthcare services and associated costs. A major barrier is the absence of a standardized and
Alain Ndayikunda +2 more
doaj +2 more sources
Mapping the path to physician leadership: lessons from a comprehensive content analysis of Korean medical school curricula [PDF]
Korean Journal of Medical EducationPurpose Despite growing recognition of the critical importance of physician leadership in delivering safe healthcare, especially in light of the 2023 medical crisis and professional resistance in Korea, existing studies on leadership education have ...
Yoolwon Jeong +3 more
doaj +2 more sources
Life Identification Numbers: A strain nomenclature approach to aid epidemiological surveillance of bacterial pathogens. [PDF]
PLoS BiologyUnified strain taxonomies are needed for the epidemiological surveillance of bacterial pathogens and international communication in microbiological research.
Federica Palma +21 more
doaj +2 more sources
On the covering radius of some modular codes
Advances in Mathematics of Communications, 2014 This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $α$ and Type $β$) and their dual and give bounds on the covering radii for MacDonald codes of both types over $\Z_4$.
Manish K Gupta, C Durairajan
exaly +3 more sources
Bounds on Covering Radius of Some Codes Over F₂ + uF₂ + vF₂ + uvF₂
IEEE Access, 2021 Let $R=\mathbb {F}_{2}+u\mathbb {F}_{2}+v\mathbb {F}_{2}+uv\mathbb {F}_{2}$ be a finite non-chain ring, where $u^{2}=u$ , $v^{2}=v$ , $uv=vu$ . We give the lower and upper bounds on the covering radius of different types of repetition codes for ...
Fanghui Ma, Jian Gao
doaj +1 more source
Covering Radius of Melas Codes [PDF]
IEEE Transactions on Information Theory, 2022 We prove that the covering radius of the Melas code M (m, q) of length n = q m − 1 over Fq is 2 if q > 3. We also prove that the covering radius of M (m, 3) is 3 is m ≥ 3, the covering radius of M (2, 3) is 4, and the covering radii of M (1, 2) and M (1, 3) are 1.
Minjia Shi +3 more
openaire +3 more sources
QC-LDPC Codes From Difference Matrices and Difference Covering Arrays
IEEE Access, 2023 We give a framework that generalizes LDPC code constructions using transversal designs or related structures such as mutually orthogonal Latin squares. Our constructions offer a broader range of code lengths and codes rates. Similar earlier constructions
Diane M. Donovan +3 more
doaj +1 more source
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
InPrime, 2022 This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +1 more source
Generalized sparse codes for non-Gaussian channels: Code design, algorithms, and applications
Fundamental Research, 2022 In this paper, generalized sparse (GS) codes are proposed to support reliable and efficient transmission over non-Gaussian channels. Specifically, by expanding the single-parity check (SPC) code constraints with powerful algebraic codes, GS codes ...
Zhao Chen +3 more
doaj +1 more source