Suchergebnisse - coding (algorithmics OR (Algorithms OR (Algorithms OR (algorithmssics OR algorithmsssssssics))))
Andere Suchmöglichkeiten:
-
1
Minimalist And Customisable Optimisation Package
Veröffentlicht 2021Inhaltsangabe: “… concentrate if necessary on his own algorithm.</p> <p>Indeed, <strong><code>Macop< …”
Volltext
Recurso digital -
2
Connectivity graph‐codes
Veröffentlicht 2024Inhaltsangabe: “… Connectivity graph‐codes Noga Alon Random Structures & Algorithms AbstractThe symmetric difference …”
Volltext
Artículo Open Access -
3
Euclid Primes computed based on the Miller-Rabin Algorithm and Pollard's Rho Algorithm
Veröffentlicht 2025Inhaltsangabe: “… Algorithm. The codes used to generate the data are available in <a href="https://github.com/cinarcivan …”
Volltext
Recurso digital -
4
Probabilistic analysis of arithmetic coding showing its robustness
Veröffentlicht 2025Inhaltsangabe: “… We probabilistically analyze the performance of the arithmetic coding algorithm under a probability …”
Volltext
Preprint -
5
Weight distribution of random linear codes and Krawtchouk polynomials
Veröffentlicht 2024Inhaltsangabe: “… Weight distribution of random linear codes and Krawtchouk polynomials Alex Samorodnitsky Random …”
Volltext
Artículo Open Access -
6
-
7
Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
Veröffentlicht 2024Inhaltsangabe: “… We first present a simple recursive algorithm that generates cyclic rotation Gray codes for stamp …”
Volltext
Preprint -
8
-
9
On the complexity and approximability of Bounded access Lempel Ziv coding
Veröffentlicht 2024Schlagworte: “… Data Structures and Algorithms …”
Volltext
Preprint -
10
Tight bounds for stream decodable error-correcting codes
Veröffentlicht 2024Inhaltsangabe: “… code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever …”
Volltext
Preprint -
11
Constant delay Gray code enumeration of ideals and antichains in posets
Veröffentlicht 2026Inhaltsangabe: “… We present an algorithm that enumerates all ideals of an input poset with constant delay in Gray …”
Volltext
Preprint -
12
Worst-case optimal adaptive alphabetic prefix-free coding
Veröffentlicht 2021Inhaltsangabe: “… We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal …”
Volltext
Preprint -
13
Generalized matching decoders for 2D topological translationally-invariant codes
Veröffentlicht 2026Inhaltsangabe: “… Two-dimensional topological translationally-invariant (TTI) quantum codes, such as the toric code …”
Volltext
Preprint -
14
Deletion-correcting codes for an adversarial nanopore channel
Veröffentlicht 2026Inhaltsangabe: “… We study deletion-correcting codes for an adversarial nanopore channel in which at most …”
Volltext
Preprint -
15
Uniformity testing when you have the source code
Veröffentlicht 2024Inhaltsangabe: “… We study quantum algorithms for verifying properties of the output probability distribution of a …”
Volltext
Preprint -
16
More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
Veröffentlicht 2024Inhaltsangabe: “… -reduction algorithm from codes over $\mathbb{F}_2$ to codes over $\mathbb{F}_q$, and we further develop …”
Volltext
Preprint -
17
Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
Veröffentlicht 2025Inhaltsangabe: “… )$ space. For specific graph classes, the algorithm can be optimized to generate edge-exchange Gray codes …”
Volltext
Preprint -
18
Trellis codes with a good distance profile constructed from expander graphs
Veröffentlicht 2026Inhaltsangabe: “… We derive Singleton-type bounds on the free distance and column distances of trellis codes. Our …”
Volltext
Preprint -
19
An approximation to the use of self-adaptive genetic algorithms in weight optimization of 3-D steel trusses
Veröffentlicht 2021Inhaltsangabe: “… An approximation to the use of self-adaptive genetic algorithms in weight optimization of 3-D steel …”
Volltext
Volltext
Volltext
Volltext
Volltext
Artículo científico -
20
Fast decision tree learning solves hard coding-theoretic problems
Veröffentlicht 2024Inhaltsangabe: “… Codeword Problem ($k$-NCP). Despite significant effort by the respective communities, algorithmic progress …”
Volltext
Preprint