Results 91 to 100 of about 16,644 (310)
Ratio Mathematica, 2012 In this paper, we study linear codes capable of detecting and correcting s-periodic errors. Lower and upper bounds on the number of parity check digits required for codes detecting such errors are obtained.
Pankaj Kumar Das, Vinod Tyagi
doaj
General Entropic Constraints on Calderbank-Shor-Steane Codes within Magic Distillation Protocols
PRX Quantum, 2023 Magic states are fundamental building blocks on the road to fault-tolerant quantum computing. Calderbank-Shor-Steane (CSS) codes play a crucial role in the construction of magic distillation protocols.
Rhea Alexander +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
Construction of regular quasi-cyclic protograph LDPC codes based on Vandermonde matrices
, 2008 In this contribution, we investigate the attainable performance of quasi-cyclic (QC) protograph Low-Density Parity-Check (LDPC) codes for transmission over both Additive White Gaussian Noise (AWGN) and uncorrelated Rayleigh channels.
Sheng Chen +5 more
core +1 more source
Lower bounds on the error probability of turbo codes [PDF]
, 2014 Date of Conference: 29 June-4 July 2014Conference name: 2014 IEEE International Symposium on Information TheoryWe present lower bounds on the error probability of turbo codes under maximum likelihood (ML) decoding.
Ayca Ozcelikkale +5 more
core +1 more source
Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers
Molecular Oncology, EarlyView.This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel +6 more
wiley +1 more source
Maximum-likelihood trellis decoding technique for balanced codes. [PDF]
, 1995 A low-complexity encoding and maximum-likelihood trellis decoding (MLTD) technique for nonlinear balanced codes is presented.
Markarian, G. S., Honary, B., Blaum, M.
core
Near-capacity iterative decoding of binary self-concatenated codes using soft decision demapping and 3-D EXIT charts [PDF]
, 2010 In this paper 3-D Extrinsic Information Transfer (EXIT) charts are used to design binary Self-Concatenated Convolutional Codes employing Iterative Decoding (SECCC-ID), exchanging extrinsic information with the soft-decision demapper to approach the ...
Butt, Muhammad Fasih +3 more
core +1 more source
Upper Bounds on the Dual Distances of EBCH Codes [PDF]
, 2005 We give new upper bounds on the dual distances of extended BCH codes of length 512. First, we apply a probabilistic algorithm due to Canteaut and Chabaud. Secondly, we put these codes in standard bit order and we use the twisted squaring decomposition of
Nedeloaia, Carmen-Simona
core +1 more source
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
IEEE Access, 2019 In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known.
Ian Blanes +3 more
doaj +1 more source