Results 61 to 70 of about 18,205,701 (285)
Linear programming bounds for doubly-even self-dual codes [PDF]
, 1997 Using a variant of linear programming method we derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives d/n
Krasikov, I +4 more
core +2 more sources
Minimal Linear Codes Constructed from Sunflowers
, 2023 Sunflower in coding theory is a class of important subspace codes and can be used to construct linear codes. In this paper, we study the minimality of linear codes over Fq constructed from sunflowers of size s in all cases.
Xia Wu, Wei Lu
core +1 more source
The n-shot classical capacity of the quantum erasure channel
Journal of Physics CommunicationsWe compute the n -shot classical capacity of the quantum erasure channel, providing upper bounds and almost-matching lower bounds for it, the latter achievable via large-minimum-distance classical linear codes for any n .
Matteo Rosati
doaj +1 more source
Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators [PDF]
IEEE Transactions on Information Theory, 2016 Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight ...
C. Lai, A. Ashikhmin
semanticscholar +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
, 2022 Linear codes have widespread applications in data storage systems. There are two major contributions in this paper. We first propose infinite families of optimal or distance-optimal linear codes over Fp constructed from projective spaces.Moreover, a ...
Luo, Gaojun, Ling, San
core +1 more source
FpRS-Additive Cyclic Codes are Asymptotically Good
IEEE AccessIn coding theory, the rate and the relative minimum distance are two important invariants to assess a family of codes’ asymptotic characteristics.
Bhanu Pratap Yadav
doaj +1 more source
On the list decodability of random linear codes with large error rates [PDF]
Symposium on the Theory of Computing, 2013 It is well known that a random q-ary code of rate Ω(ε2) is list decodable up to radius (1 - 1/q - ε) with list sizes on the order of 1/ε2, with probability 1 - o(1).
Mary K. Wootters
semanticscholar +1 more source
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Optimal minimal linear codes from posets
, 2020 Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes.
Wu, Yansheng +3 more
core +1 more source