Results 31 to 40 of about 37,403 (267)

Cyclic lowest density MDS array codes [PDF]

open access: yes, 2009
Three new families of lowest density maximum-distance separable (MDS) array codes are constructed, which are cyclic or quasi-cyclic. In addition to their optimal redundancy (MDS) and optimal update complexity (lowest density), the symmetry offered by the
Bruck, Jehoshua, Cassuto, Yuval
core   +4 more sources

On the codes over the Z_3+vZ_3+v^2Z_3

open access: yes, 2015
In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew constacyclic codes over
Cengellenmis, Yasein   +2 more
core   +1 more source

High-Speed Reconciliation for CVQKD Based on Spatially Coupled LDPC Codes

open access: yesIEEE Photonics Journal, 2018
The speed of continuous variable quantum key distribution is limited by the reconciliation efficiency and the reconciliation frame error rate (FER) in the reconciliation phase.
Xue-Qin Jiang   +3 more
doaj   +1 more source

New cubic self-dual codes of length 54, 60 and 66

open access: yes, 2017
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by constructing 1 new
Kim, Jon-Lark   +2 more
core   +1 more source

Combinatorial design-based quasi-cyclic LDPC codes with girth eight

open access: yesDigital Communications and Networks, 2018
This paper presents a novel regular Quasi-Cyclic (QC) Low Density Parity Check (LDPC) codes with column-weight three and girth at least eight. These are designed on the basis of combinatorial design in which subsets applied for the construction of ...
Sina Vafi, Narges Rezvani Majid
doaj   +1 more source

Quasi-cyclic Codes of Index 1.5

open access: yesCoRR, 2015
We introduce quasi-cyclic codes of index 1.5, construct such codes in terms of polynomials and matrices; and prove that the quasi-cyclic codes of index 1.5 are asymptotically good.
Yun Fan, Hualu Liu
openaire   +2 more sources

Molecular Dynamics Studies of Shape Memory Polymers: From Bead–Spring Models to Atomistic Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
Coarse‐grained (left) and atomistic (right) models of the shape memory polymer ESTANE ETE 75DT3 are shown schematically. The two representations bridge molecular detail and mesoscopic description. Both models capture shape memory behavior, linking segmental mobility and conformational relaxation of anisotropic chains to macroscopic recovery, and ...
Fathollah Varnik
wiley   +1 more source

Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code

open access: yesTongxin xuebao, 2008
Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code ...
ZHANG Guo-hua, WANG Xin-mei
doaj   +2 more sources

Ldpc Code Construction using Randomly Permutated Copies of Parity Check Matrix [PDF]

open access: yesمجلة جامعة النجاح للأبحاث العلوم الطبيعية, 2018
A construction technique is proposed for low-density parity check (LDPC) codes. It uses a base parity check matrix designed from a ran-dom or constructed construction method as Gallager or Quasi-Cyclic LDPC (QC-LDPC) codes in sequence to get codes with ...
Amr lulu, Ammar Abu-Hudrouss
doaj   +1 more source

Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance

open access: yes, 2014
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends the BCH ...
Ling, San, Zeh, Alexander
core   +2 more sources

Home - About - Disclaimer - Privacy