Results 31 to 40 of about 12,742 (264)
Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions
AbstractIn this paper, constructions of frameproof codes, separable codes, and $$B_2$$ B 2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes.
Fernández Muñoz, Marcel +2 more
openaire +5 more sources
Error-Correcting Codes on Projective Bundles over Deligne–Lusztig Varieties
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne–Lusztig surfaces.
Daniel Camazón Portela +1 more
doaj +1 more source
New Binary Quantum Codes Derived From One-Generator Quasi-Cyclic Codes
In this paper, we consider a family of one-generator quasi-cyclic (QC) codes and their applications in quantum codes construction. We give a sufficient condition for one-generator QC codes to be self-orthogonal with respect to the symplectic inner ...
Jingjie Lv, Ruihu Li, Junli Wang
doaj +1 more source
Some New Quantum BCH Codes over Finite Fields
Quantum error correcting codes (QECCs) play an important role in preventing quantum information decoherence. Good quantum stabilizer codes were constructed by classical error correcting codes.
Lijuan Xing, Zhuo Li
doaj +1 more source
Construction and bounds for subspace codes
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In this chapter we survey known constructions and upper bounds for subspace codes.
openaire +2 more sources
Capacity-Approaching Non-Binary Turbo Codes: A Hybrid Design Based on EXIT Charts and Union Bounds
In this paper, we introduce a novel design approach for capacity-approaching non-binary turbo codes. There are two important factors that impact the performance of turbo codes in general: 1) the convergence behavior of iterative decoding in the low ...
Toshiki Matsumine, Hideki Ochiai
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On Stronger Types of Locating-dominating Codes [PDF]
Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in a sensor network, but if there is more than one object, it may lead to ...
Ville Junnila +3 more
doaj +1 more source
ABSTRACT The International Paediatric Oncology Society Global Mapping Programme aims to collect data on global paediatric oncology services by continent, with Africa and Latin America completed. This study reports on the methodology and lessons learned for Oceania, a unique continent with resource disparity across countries, multiple small island ...
Trisha Soosay Raj +16 more
wiley +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source

