Results 71 to 80 of about 681,054 (287)

Super-Orthogonal Block Codes with Multichannel Equalisation and OFDM in Frequency Selective Fading

open access: yesEURASIP Journal on Wireless Communications and Networking, 2010
Super-orthogonal block codes in space-time domain (i.e., Super-orthogonal space-time trellis codes (SOSTTCs)) were initially designed for frequency nonselective (FNS) channels but in frequency selective (FS) channels these super-orthogonal block codes ...
O. Sokoya, B. T. Maharaj
doaj   +2 more sources

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular 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

Finite Length Analysis of Low-Density Parity-Check Codes on Impulsive Noise Channels

open access: yesIEEE Access, 2016
Low-density parity-check (LDPC) codes with very long block lengths are well known for their powerful error correction, but it is not always desirable to employ long codes in communication systems, where latency is a serious issue, such as voice and video
Zhen Mei   +3 more
doaj   +1 more source

Block QPSK modulation codes with two levels of error protection [PDF]

open access: yes, 1994
A class of block QPSK modulation codes for unequal error protection (UEP) is presented. These codes are particularly suitable either for broadcast channels or for communication systems where parts of the information messages are more important than ...
Lin, Shu, Morelos-Zaragoza, Robert H
core   +1 more source

When Do WOM Codes Improve the Erasure Factor in Flash Memories?

open access: yes, 2015
Flash memory is a write-once medium in which reprogramming cells requires first erasing the block that contains them. The lifetime of the flash is a function of the number of block erasures and can be as small as several thousands.
Maor, Gal   +3 more
core   +1 more source

Circular RNA expression landscapes in myelodysplastic neoplasms: Associations with mutational signatures and disease progression

open access: yesMolecular Oncology, EarlyView.
In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge   +17 more
wiley   +1 more source

Decoding LDPC Convolutional Codes on Markov Channels

open access: yesEURASIP Journal on Wireless Communications and Networking, 2008
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model.
Chris Winstead, Manohar Kashyap
doaj   +2 more sources

Convolutional cylinder-type block-circulant cycle codes [PDF]

open access: yesTransactions on Combinatorics, 2013
In this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix
Mohammad Gholami, Mehdi Samadieh
doaj  

Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes

open access: yes, 2014
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy ...
Fujiwara, Yuichiro   +2 more
core   +1 more source

Blocking sets, minimal codes and trifferent codes

open access: yesJournal of the London Mathematical Society
AbstractWe prove new upper bounds on the smallest size of affine blocking sets, that is, sets of points in a finite affine space that intersect every affine subspace of a fixed codimension. We show an equivalence between affine blocking sets with respect to codimension‐2 subspaces that are generated by taking a union of lines through the origin, and ...
Anurag Bishnoi   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy