Results 1 to 10 of about 7,413 (88)

Improved positive predictive value of non-invasive prenatal testing through integration with second-trimester ultrasound soft markers for fetal chromosomal abnormalities: a retrospective cohort study [PDF]

open access: yesFrontiers in Endocrinology
BackgroundNon-invasive prenatal testing (NIPT) achieves high sensitivity for common fetal aneuploidies; however, its positive predictive value (PPV) varies substantially with population prevalence, generating a considerable false-positive burden. Current
Dan Fu   +4 more
doaj   +2 more sources

Timing of birth to improve outcomes in chronic or gestational hypertension: the WILL RCT

open access: yesHealth Technology Assessment
Background For women with chronic or gestational hypertension who remain well, early term birth (at 37–38 weeks’ gestation) may reduce maternal complications, caesareans and stillbirths, but it may increase neonatal morbidity compared with expectant care.
Katie Kirkham   +16 more
doaj   +2 more sources

Generalized Singleton Type Upper Bounds

open access: yesCoRR, 2022
In this paper, we give upper bounds on the sizes of $(d, L)$ list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to $d$. When the list size $L$ is $1$, this gives many new Singleton type upper bounds on the sizes of codes with a given minimum Hamming distance.
Chen, Hao   +4 more
openaire   +2 more sources

MDS Constacyclic Codes and MDS Symbol-Pair Constacyclic Codes

open access: yesIEEE Access, 2021
Symbol-pair codes are used to protect against symbol-pair errors in high density data storage systems. One of the most important tasks in symbol-pair coding theory is to design MDS codes.
Hai Q. Dinh   +3 more
doaj   +1 more source

Singleton-type bounds for list-decoding and list-recovery, and related results

open access: yes2022 IEEE International Symposium on Information Theory (ISIT), 2022
22 ...
Eitan Goldberg   +2 more
openaire   +3 more sources

Relating Church-Style and Curry-Style Subtyping [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
Type theories with higher-order subtyping or singleton types are examples of systems where computation rules for variables are affected by type information in the context.
Adriana Compagnoni, Healfdene Goguen
doaj   +1 more source

Optimal Quaternary (r,delta)-Locally Repairable Codes Achieving the Singleton-type Bound

open access: yesCoRR, 2021
Locally repairable codes enables fast repair of node failure in a distributed storage system. The code symbols in a codeword are stored in different storage nodes, such that a disk failure can be recovered by accessing a small fraction of the storage nodes. The number of storage nodes that are contacted during the repair of a failed node is a parameter
Kenneth W. Shum, Jie Hao
openaire   +2 more sources

Optimal (r, δ)-Locally Repairable Codes From Simplex Code and Cap Code

open access: yesIEEE Access, 2020
Locally repairable codes (LRCs) are implemented in distributed storage systems (DSSs) due to their low repair overhead. A linear code $\mathcal {C}$ is said to have $(r,\delta)$ -locality if for each coordinate $i$ , there exists a punctured subcode ...
Qiang Fu, Ruihu Li, Sen Yang
doaj   +1 more source

An Upper Bound of Singleton Type for Componentwise Products of Linear Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2013
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical Singleton bound.
openaire   +3 more sources

A Construction of Optimal $(r,\delta)$ -Locally Recoverable Codes

open access: yesIEEE Access, 2019
Locally recoverable codes (LRCs) play a significant role in distributed and cloud storage systems. The key ingredient for constructing such optimal LRCs is to characterize the parity-check matrix for LRCs.
Bocong Chen, Jing Huang
doaj   +1 more source

Home - About - Disclaimer - Privacy