Risultati della ricerca - (coding OR decoding) (Algorithms OR algorithmsssic)

Tight bounds for stream decodable error-correcting codes di Gupta, Meghal, Guruswami, Venkatesan, Singhal, Mihir

Sommario: “... code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever...”
Testo

Generalized matching decoders for 2D topological translationally-invariant codes di Tan, Shi Jie Samuel, Gill, Ian, Huang, Eric, Liu, Pengyu, Zhao, Chen, Dehghani, Hossein, Kubica, Aleksander, Zhou, Hengyun, Dua, Arpit

Sommario: “.... For such codes to be practically relevant, their decoders must successfully correct the most likely errors while...”
Testo

Connectivity graph‐codes di Noga Alon

Sommario: “...Connectivity graph‐codes Noga Alon Random Structures & Algorithms AbstractThe symmetric difference...”
Testo

Probabilistic analysis of arithmetic coding showing its robustness di Mahmoud, Hosam M., Rivertz, Hans J.

Sommario: “...We probabilistically analyze the performance of the arithmetic coding algorithm under a probability...”
Testo

Weight distribution of random linear codes and Krawtchouk polynomials di Alex Samorodnitsky

Sommario: “...Weight distribution of random linear codes and Krawtchouk polynomials Alex Samorodnitsky Random...”
Testo

On the complexity and approximability of Bounded access Lempel Ziv coding di Cicalese, Ferdinando, Ugazio, Francesca

Soggetti: “...Data Structures and Algorithms...”
Testo

Deletion-correcting codes for an adversarial nanopore channel di Xie, Huiling, Chen, Zitan

Sommario: “...We study deletion-correcting codes for an adversarial nanopore channel in which at most...”
Testo

Worst-case optimal adaptive alphabetic prefix-free coding di Gagie, Travis

Sommario: “...We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal...”
Testo

Constant delay Gray code enumeration of ideals and antichains in posets di Brenner, Sofia, Fink, Jiří

Sommario: “... code order, i.e., such that consecutively visited ideals differ in at most three elements. This answers...”
Testo

Uniformity testing when you have the source code di Canonne, Clément L., Kothari, Robin, O'Donnell, Ryan

Sommario: “... classical or quantum circuit, given access to the source code that generates the distribution. We consider...”
Testo

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders di Liu, Bowie, Wong, Dennis, Lam, Chan-Tong, Im, Marcus

Sommario: “...We first present a simple recursive algorithm that generates cyclic rotation Gray codes for stamp...”
Testo

Fast decision tree learning solves hard coding-theoretic problems di Koch, Caleb, Strassle, Carmen, Tan, Li-Yang

Soggetti: “...Data Structures and Algorithms...”
Testo

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more di Ghentiyala, Surendra, Stephens-Davidowitz, Noah

Sommario: “... on Information Theory, 2022], which introduced the notion of basis reduction for codes, in analogy...”
Testo

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time di Liu, Bowie, Wong, Dennis, Lam, Chan-Tong, Im, Sio-Kei

Sommario: “...We present the first known pivot Gray code for spanning trees of complete graphs, listing all...”
Testo

Trellis codes with a good distance profile constructed from expander graphs di Zhu, Yubin, Chen, Zitan

Sommario: “...We derive Singleton-type bounds on the free distance and column distances of trellis codes. Our...”
Testo

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word di Burcsi, Péter, Fici, Gabriele, Lipták, Zsuzsanna, Raman, Rajeev, Sawada, Joe

Sommario: “... exhaustively list all prefix normal words of length $n$ as a combinatorial Gray code, where successive strings...”
Testo

Algorithmic counting of nonequivalent compact Huffman codes di Elsholtz, Christian, Heuberger, Clemens, Krenn, Daniel

Sommario: “...)$: the number of nonequivalent compact Huffman codes of length~$n$ over an alphabet of $t$ letters, the number...”
Testo

Inference in Normal Form: Unifying LLM Tricks via TRoT di Takahashi, K

Sommario: “...-time</em> methods for large language models (LLMs)—e.g., <strong>MBR/eMBR decoding...”
Testo

Algorithms of self-synchronizing single-deletion-correcting codes di Choi, Whan-Hyuk

Sommario: “... present encoding and decoding algorithms for self-synchronizing single-deletion correcting DNA codes...”
Testo

Algorithmic bottlenecks in evolution: Genetic code, symbolic language, and the Great Filter hypothesis di Prokopenko, Mikhail, Ay, Nihat, Breviario, Angelica, Crocker, Roland M., Davies, Paul C. W., Davies, Pauline, Dougan, Darren, Fletcher, Roland, Harré, Michael, Heisler, Marcus G., Kuncic, Zdenka, Lewis, Geraint F., Livson, Ori, Reiner, Vivienne, Serra, Jaime Ruiz

Sommario: “..., we argue that two deeply structural obstacles dominate the evolutionary landscape: the coding...”
Testo