Results 31 to 40 of about 13,649 (264)
Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions
Cryptography and Communications, 2023 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 +6 more sources
Error-Correcting Codes on Projective Bundles over Deligne–Lusztig Varieties
Mathematics, 2023 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
IEEE Access, 2019 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
Entropy, 2021 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
CoRR, 2021 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 +3 more sources
Capacity-Approaching Non-Binary Turbo Codes: A Hybrid Design Based on EXIT Charts and Union Bounds
IEEE Access, 2018 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
Journal of Combinatorial Theory, Series A, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Stronger Types of Locating-dominating Codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 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
Referral Patterns and Diagnostic Timeliness in Pediatric Cancer: A Hospital‐Based Study in Indonesia
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Timely diagnosis and treatment are critical for improving survival among children with cancer. In low‐ and middle‐income countries (LMICs), delays are common and may be influenced by fragmented referral pathways and diagnostic limitations.
Nur Melani Sari +5 more
wiley +1 more source
Upper Bounds on Separating Codes
IEEE Transactions on Information Theory, 2004 The combinatorial concept of separating systems has numerous applications, such as automata theory, digital fingerprinting, group testing, and hashing. In this correspondence, we derive upper bounds on the size of codes with various separating properties.
Cohen, Gerard D., Schaathun, H.
openaire +5 more sources