Results 51 to 60 of about 9,399 (155)

Sub-Optimal Degree Distribution untuk Prioritas Komunikasi Manusia menggunakan Proyeksi EXIT Chart pada Jaringan Masa Depan

Jurnal Elkomika, 2019
ABSTRAK Pada jaringan masa depan melibatkan komunikasi antara mesin dan manusia. Penelitian ini mengusulkan konsep coding dalam jaringan menggunakan Maximum Distance Separable (MDS) codes.
SOLICHAH LARASATI, KHOIRUN NI’AMAH
doaj   +1 more source

Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding

Information, 2019
The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the ...
Hua Sun, Chao Tian
doaj   +1 more source

On negacyclic MDS-convolutional codes

Linear Algebra and its Applications, 2014
New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.
openaire   +2 more sources

DR-MDS: An Energy-Efficient Coding Scheme in D2D Distributed Storage Network for the Internet of Things

IEEE Access, 2019
The Internet of Things (IoT) is a promising technology for the collection data among the seamless connectivity with massive physical devices for future 5G networks.
Shushi Gu, Juan Li, Ye Wang, Niannian Wang, Qinyu Zhang   +4 more
doaj   +1 more source

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

Tongxin 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

Direct construction of quasi-involutory recursive-like MDS matrices from 2-cyclic codes

IACR Transactions on Symmetric Cryptology, 2017
A good linear diffusion layer is a prerequisite in the design of block ciphers. Usually it is obtained by combining matrices with optimal diffusion property over the Sbox alphabet.
Victor Cauchois, Pierre Loidreau, Nabil Merkiche   +2 more
doaj   +1 more source

New Systematic MDS Array Codes With Two Parities

IEEE Open Journal of the Communications Society
Row-diagonal parity (RDP) code is a classical $(k+2,~k)$ systematic maximum distance separable (MDS) array code with $k \leq L-1$ under sub-packetization level $l = L-1$ , where L is a prime integer.
Lan Ma, Liyang Zhou, Shaoteng Liu, Xiangyu Chen, Qifu Sun   +4 more
doaj   +1 more source

Group Codes Over Dihedral Group Algebras 𝔽q[D16] and 𝔽q[Z2 × D8]

Journal of Mathematics
Let Fq denote a finite field of characteristic p, where q=pk for some prime p and integer k. Let Dn represent a dihedral group of order n. In this paper, group codes in the dihedral group algebras FqD16 and FqZ2×D8 are proposed.
Zhihao Tian, Yanyan Gao
doaj   +1 more source

Higher-Order MDS Codes

IEEE Transactions on Information Theory, 2022
An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then defined as codes that attain this bound (under a slightly stronger notion of list decodability), with 1-MDS codes corresponding to ordinary linear MDS codes.
openaire   +2 more sources

MDS stabilizer poset codes

Designs, Codes and Cryptography
Abstract Poset metrics in the context of stabilizer codes are investigated. We establish a Singleton-type bound for stabilizer poset codes and introduce the notion of MDS stabilizer poset codes. Several characterizations of these codes are obtained, including criteria in terms of additive codes and perfect codes.
openaire   +2 more sources