Results 31 to 40 of about 566,775 (253)

Construction of MDS self-dual codes over Galois rings

open access: yes, 2017
The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory ser A, 105:79-95).
이윤진
core   +1 more source

Perceptions of and barriers to ethical promotion of pharmaceuticals in Pakistan: perspectives of medical representatives and doctors

open access: yesBMC Medical Ethics, 2021
Background In Pakistan, drug promotion practices, ethical or unethical, have rarely been in the spotlight. We aimed to assess the perception and barriers of medical representatives (MRs) and doctors (MDs) regarding ethical promotion of pharmaceuticals in
Rehan Gul   +8 more
doaj   +1 more source

Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps

open access: yesIEEE Access, 2021
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length $6p^{s}$ over $\mathbb F_{p^{m}}$ .
Hai Q. Dinh   +3 more
doaj   +1 more source

Random construction of partial MDS codes

open access: yes, 2020
This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage systems. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any maximum rank ...
Horlemann-Trautmann A. -L., Neri A.
core   +1 more source

Constructions of MDS-convolutional codes [PDF]

open access: yes, 2001
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound.
Gluesing-Luerssen, H   +2 more
core   +1 more source

Lifted MDS Codes over Finite Fields [PDF]

open access: yes, 2022
MDS codes are elegant constructions in coding theory and have mode important applications in network coding, distributed data storage, communication systems etc. In this study, a method is given which MDS codes are lifted to a higher finite field.
Elif Segah OZTAS, Öztaş, Elif Segah
core   +1 more source

Bridging the Loneliness Gap: Depression, Connectivity, and Isolation in Pediatric Oncology Patients and Their Peers

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Loneliness is associated with adverse physical and mental health outcomes and remains understudied in children and adolescents undergoing cancer therapy. Pediatric oncology patients may be at increased risk due to medical isolation and disruption of social networks.
Charlotte N. Stahlfeld   +5 more
wiley   +1 more source

A Family of Almost MDS Symbol-Pair Codes of Length 8p

open access: yesIEEE Access
In high-density data storage systems, symbol-pair codes are commonly used to prevent symbol-pair errors. Designing maximum distance separable (MDS) codes is crucial in symbol-pair coding theory because MDS symbol-pair codes are the best at meeting the ...
Hai Q. Dinh   +3 more
doaj   +1 more source

Ideal threshold schemes from MDS codes

open access: yes, 2003
We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret.
Josef Pieprzyk   +3 more
core   +1 more source

Retrospective Analysis of Donor Lymphocyte Infusions in Pediatric Patients With Mixed Chimerism After Hematopoietic Stem Cell Transplantation

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Allogeneic hematopoietic stem cell transplantation (alloHSCT) is an essential therapy for several malignant and nonmalignant diseases, but relapse and graft loss remain the principal threats to its success. Routine monitoring of chimerism and minimal residual disease (MRD) enables early detection of imminent recurrence and guides ...
Carmen Junk   +10 more
wiley   +1 more source

Home - About - Disclaimer - Privacy