Results 31 to 40 of about 13,959 (300)
A Combinatorial Approach to Flag Codes
In network coding, a flag code is a collection of flags, that is, sequences of nested subspaces of a vector space over a finite field. Due to its definition as the sum of the corresponding subspace distances, the flag distance parameter encloses a hidden combinatorial structure.
Clementa Alonso-González +1 more
openaire +2 more sources
Introduction. The application of binary-reflected (mirror, reflexive) Gray codes for solving combinatorial problems with pseudo-Boolean functions (polynomials from Boolean variables) is considered.
Oleksandr Trofymchuk +4 more
doaj +1 more source
A unified approach to combinatorial key predistribution schemes for sensor networks [PDF]
There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes.
Paterson, Maura B. +3 more
core +1 more source
General Fractional Repetition Codes From Combinatorial Designs
Fractional repetition codes are a class of distributed storage codes dedicated to optimize the node repair performance, i.e., they enable uncoded exact repairs with minimum bandwidth consumption.
Bing Zhu, Hui Li, Shuo-Yen Robert Li
doaj +1 more source
In clustered distributed storage systems (CDSSs), one of the main design goals is minimizing the transmission cost during the failed storage nodes repairing. Generalized regenerating codes (GRCs) are proposed to balance the intra‐cluster repair bandwidth
Shushi Gu +4 more
doaj +1 more source
Sliding-window dynamic frameproof codes [PDF]
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper, we formally define sliding-window dynamic frameproof codes and provide optimal constructions ...
Paterson, Maura, Paterson, Maura B.
core +1 more source
The combinatorics of combinatorial coding by a real [PDF]
AbstractWe lay the combinatorial foundations for [5] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
Saharon Shelah, Lee J. Stanley
openaire +3 more sources
Isometry groups of combinatorial codes [PDF]
Two isometry groups of combinatorial codes are described: the group of isometries, that is, the group of Hamming isometries from a code to itself and the group of monomial isometries, which is the group of those isometries of a code to itself that extend to monomial maps.
openaire +3 more sources
Specification of neuronal identities by feedforward combinatorial coding.
Neuronal specification is often seen as a multistep process: earlier regulators confer broad neuronal identity and are followed by combinatorial codes specifying neuronal properties unique to specific subtypes.
Magnus Baumgardt +4 more
doaj +1 more source
On erasure combinatorial batch codes
Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers, each of which stores a subset of the items. A batch code is an arrangement for storing items on servers so that, for prescribed integers $k$
JiYoon Jung +3 more
openaire +3 more sources

