Results 61 to 70 of about 177,188 (278)
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
SSCANL decoder based joint iterative detection and decoding algorithm
Dianxin kexue, 2022 In order to improve the receiver performance of the sparse code multiple access (SCMA) system based on polar codes, the cyclic redundancy check (CRC) aided joint iterative detection and decoding receiver scheme based on simplify soft cancellation list ...
Chongyang LIU, Rui GUO
doaj +2 more sources
A Reduced Latency List Decoding Algorithm for Polar Codes
, 2014 Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm.
Lin, Jun, Xiong, Chenrong, Yan, Zhiyuan
core +1 more source
Molecular Oncology, EarlyView.Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source
Fast Polar Decoding With Successive Cancellation List Creeper Algorithm
IEEE AccessPolar codes have emerged as a focal point in the field of error-correcting codes, owing to their remarkable capacity-achieving characteristics and their relevance in various modern communication systems. The basic successive cancellation (SC) approach is
Ilya Timokhin, Fedor Ivanov
doaj +1 more source
Successive Cancellation Priority Decoding of Polar Codes
IEEE Access, 2019 The successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity.
Di Guan, Kai Niu, Chao Dong, Ping Zhang
doaj +1 more source
List Decodability of Symbol-Pair Codes [PDF]
IEEE Transactions on Information Theory, 2019 We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decoded up to the Gilbert-Varshamov bound.
Shu Liu, Chaoping Xing, Chen Yuan
openaire +3 more sources
Molecular Oncology, EarlyView.The LINC01116 long noncoding RNA is induced by hypoxia and associated with poor prognosis and high recurrence rates in two cohorts of lung adenocarcinoma patients. Here, we demonstrate that besides its expression in cancer cells, LINC01116 is markedly expressed in lymphatic endothelial cells of the tumor stroma in which it participates in hypoxia ...
Marine Gautier‐Isola +12 more
wiley +1 more source
Transformation of Binary Linear Block Codes to Polar Codes With Dynamic Frozen
IEEE Open Journal of the Communications Society, 2020 In this paper, a general transformation of binary linear block codes (BLBCs) to (possibly, multi-kernel) polar codes with dynamic frozen bits is proposed.
Chien-Ying Lin +3 more
doaj +1 more source
List-Decodable Zero-Rate Codes
IEEE Transactions on Information Theory, 2019 We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $ \in [0,1]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $ $ in the binary hypercube (of arbitrary dimension) with the property that no point of the ...
Noga Alon, Boris Bukh, Yury Polyanskiy
openaire +3 more sources