Results 61 to 70 of about 18,947 (303)
IEEE Access, 2023 A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this integer residue ring which is closed under the action of constant multiplication by the Gaussian or Eisenstein integers. In this paper, we define
Hajime Matsui
doaj +1 more source
Error-correcting Source Code [PDF]
, 1998 We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are turning to play fundamental roles in debugging concurrent logic/constraint programs as well as in establishing the consistency of communication protocols and in optimization.
Yasuhiro Ajiro +2 more
openaire +1 more source
Iterative channel equalization, channel decoding and source decoding
, 2005 The performance of soft source decoding is evaluated over dispersive AWGN channels. By employing source codes having error-correcting capabilities, such as Reversible Variable-Length Codes (RVLCs) and Variable-Length Error-Correcting (VLEC) codes, the ...
Wang, J., Yang, L-L., Hanzo, L.
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Choice of Optimal Error-Correcting Code for Physical Unclonable Functions
, 2015 This thesis explores error-correcting codes which can be used in physical unclonable function (PUF) applications. We investigate linear block codes and concatenated codes, which are traditionally used with PUFs, and compare them to convolutional codes ...
Jarvis, Brian
core +1 more source
On the number of errors correctable with codes on graphs [PDF]
2009 IEEE International Symposium on Information Theory, 2009 We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum distance of codes in these ensembles grows linearly with the code length.
Alexander Barg, Arya Mazumdar
openaire +2 more sources
Molecular Oncology, EarlyView.We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober +16 more
wiley +1 more source
MODERATE-DENSITY BURST ERROR CORRECTING LINEAR CODES
Ratio Mathematica, 2003 Lower and upper bounds for the existence of linear codes which correct burst of length b (fixed) and whose weight lies between certain limits have been presented.
Bal Kishan Dass, Gangmei Sobha
doaj
A McEliece cryptosystem using permutation codes
Journal of Mathematical CryptologyThis paper is an attempt to build a new public-key cryptosystem, similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes.
Srinivasan Adarsh, Mahalanobis Ayan
doaj +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source