Results 21 to 30 of about 681,054 (287)
On cutting blocking sets and their codes [PDF]
Forum Mathematicum, 2022 AbstractLetPG(r,q){\operatorname{PG}(r,q)}be ther-dimensional projective space over the finite fieldGF(q){\operatorname{GF}(q)}. A set𝒳{\mathcal{X}}of points ofPG(r,q){\operatorname{PG}(r,q)}is a cutting blocking set if for each hyperplane Π ofPG(r,q){\operatorname{PG}(r,q)}the setΠ∩𝒳{\Pi\cap\mathcal{X}}spans Π.
Bartoli, Daniele +3 more
openaire +6 more sources
STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM [PDF]
ICTACT Journal on Communication Technology, 2012 The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes.
H. Prashantha Kumar +3 more
doaj
Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects
EURASIP Journal on Wireless Communications and Networking, 2023 It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding.
Massimo Battaglioni +4 more
doaj +1 more source
Quantum LDPC Codes Based on Cocyclic Block Matrices
Entropy, 2023 Motivated by a family of binary cocyclic block matrices over GF(2), we proposed a construction method to gain the stabilizer of long-length quantum error-correction codes (QECCs).
Yuan Li, Ying Guo
doaj +1 more source
Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
IEEE Access, 2019 In a distributed storage system, regenerating codes can be utilized to ensure data availability. This reduces the repair bandwidth but increases the risk of data eavesdropping on each node.
Jianchao Bian +3 more
doaj +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
Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes
, 2005 Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum convolutional codes are constructed from classical self-orthogonal $\F_4$-linear and $\F_2$-linear convolutional codes, respectively.
Forney, Jr., G. David, Guha, Saikat
core +2 more sources
Robust rateless space time block coding for mmWave massive MIMO system
HeliyonIn the vast growing wireless communication system creating robust encoding mechanisms using space-time block codes (STBC) for mmWave massive MIMO to overcome uncertainty and ensure reliability is a critical concept to be covered. This article reviews the
Zelalem A. Kelem, Habib M. Hussein
doaj +1 more source
A PEG Construction of LDPC Codes Based on the Betweenness Centrality Metric
Advances in Electrical and Computer Engineering, 2016 Progressive Edge Growth (PEG) constructions are usually based on optimizing the distance metric by using various methods. In this work however, the distance metric is replaced by a different one, namely the betweenness centrality metric, which was ...
BHURTAH-SEEWOOSUNGKUR, I. +2 more
doaj +1 more source
Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity
, 2013 Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM ...
Jithamithra, G. R., Rajan, B. Sundar
core +1 more source