Results 21 to 30 of about 13,959 (300)
Quantum XYZ Product Codes [PDF]
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classical LDPC codes, this "XYZ product" yields a non CSS quantum LDPC code ...
Anthony Leverrier +2 more
doaj +1 more source
A combinatorial property of finite prefix codes
A necessary and sufficient condition is given under which a finite prefix code A (A ⊆ X*) is maximal. This condition, which does not hold in general for infinite rational prefix codes, is derived from a main theorem obtained by means of a combinatorial method consisting of the construction for any prefix code and word f ε X* of a suitable sequence of ...
DE LUCA, ALDO
openaire +4 more sources
Down-step statistics in generalized Dyck paths [PDF]
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied.
Andrei Asinowski +2 more
doaj +1 more source
CBFISKD: A Combinatorial-Based Fuzzy Inference System for Keylogger Detection
A keylogger is a type of spyware that records keystrokes from the user’s keyboard to steal confidential information. The problems with most keylogger methods are the lack of simulated keylogger patterns, the failure to maintain a database of current ...
Femi Emmanuel Ayo +5 more
doaj +1 more source
Enumeration of Optimal Equidistant Codes
Problems of search and enumeration of binary and ternary equidistant codes are considered in the paper. We investigate some combinatorial algorithms and develop specialized computer packages to find non-equivalent optimal binary and ternary equidistant ...
Galina Bogdanova, Todor Todorov
doaj +1 more source
Multiset combinatorial batch codes [PDF]
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from each server. Combinatorial batch codes, are replication-based batch codes in which each server stores a
Hui Zhang 0030 +2 more
openaire +2 more sources
On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound
Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combinatorial
Iliya Bouyukliev +2 more
doaj +1 more source
Combinatorial designs have many interesting and genuine wide applications in areas including analysis and design of algorithms, cryptography, analysis and design of experiments, storage system design, tournament scheduling, optical communications, and ...
A. El-Mesady +2 more
doaj +1 more source
Bio-Constrained Codes with Neural Network for Density-Based DNA Data Storage
DNA has evolved as a cutting-edge medium for digital information storage due to its extremely high density and durable preservation to accommodate the data explosion. However, the strings of DNA are prone to errors during the hybridization process.
Abdur Rasool +3 more
doaj +1 more source
On the generalized Hamming weights of certain Reed–Muller-type codes
There is a nice combinatorial formula of P. Beelen and M. Datta for the r-th generalized Hamming weight of an a ne cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the r-th generalized Hamming weight for a ...
González-Sarabia Manuel +2 more
doaj +1 more source

