Risultati della ricerca - (encoding OR (decoding OR coding)) (Algorithms OR (algorithmsssic 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

Height-bounded Lempel-Ziv encodings di Bannai, Hideo, Funakoshi, Mitsuru, Hendrian, Diptarama, Matsuda, Myuji, Puglisi, Simon J.

Sommario: “...We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations...”
Testo

Adaptive encodings for small and fast compressed suffix arrays di Díaz-Domínguez, Diego, Mäkinen, Veli

Sommario: “...), an encoding technique for BWT-based CSAs that adapts the amount of indexing information to local...”
Testo

Connectivity graph‐codes di Noga Alon

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

Space-efficient SLP encoding for $O(\log N)$-time random access di Takasaka, Akito, I, Tomohiro

Sommario: “... to encode $G$ in $n \lceil \lg N \rceil + (n + n') \lceil \lg (n+σ) \rceil + 4n - 2n' + o(n)$ bits...”
Testo

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla di Chakraborty, Shantanav, Hazra, Soumyabrata, Li, Tongyang, Shao, Changpeng, Wang, Xinzhao, Zhang, Yuxin

Sommario: “... of QSVT rely on block encoding, incurring an intrinsic $O(\log L)$ ancilla overhead and circuit depth...”
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

Sommario: “...) encoding of $T$ based on $φ$, it is possible to identify/decompress the character $s_p$ by performing...”
Testo

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem di Zhong, Dawei, Francis, Akhil, Rrapaj, Ermal

Sommario: “... deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block encoding...”
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

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions di Oum, Sang-il, Sokołowski, Marek

Soggetti: “...Data Structures and Algorithms...”
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