Suchergebnisse - (encoding OR (decoding OR coding)) Algorithms

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

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

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

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

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

Inhaltsangabe: “… We introduce height-bounded LZ encodings (LZHB), a new family of compressed representations …”
Volltext

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

Inhaltsangabe: “… ), an encoding technique for BWT-based CSAs that adapts the amount of indexing information to local …”
Volltext

Connectivity graph‐codes von Noga Alon

Inhaltsangabe: “… Connectivity graph‐codes Noga Alon Random Structures & Algorithms AbstractThe symmetric difference …”
Volltext

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

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

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

Inhaltsangabe: “… of QSVT rely on block encoding, incurring an intrinsic $O(\log L)$ ancilla overhead and circuit depth …”
Volltext

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

Inhaltsangabe: “… We probabilistically analyze the performance of the arithmetic coding algorithm under a probability …”
Volltext

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

Inhaltsangabe: “… Weight distribution of random linear codes and Krawtchouk polynomials Alex Samorodnitsky Random …”
Volltext

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

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

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

Inhaltsangabe: “… deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block encoding …”
Volltext

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

Inhaltsangabe: “… We study deletion-correcting codes for an adversarial nanopore channel in which at most …”
Volltext

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

Inhaltsangabe: “… We give the first algorithm for adaptive alphabetic prefix-free coding that is worst-case optimal …”
Volltext

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

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

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

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

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

Inhaltsangabe: “… We first present a simple recursive algorithm that generates cyclic rotation Gray codes for stamp …”
Volltext

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

Schlagworte: “… Data Structures and Algorithms …”
Volltext

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

Schlagworte: “… Data Structures and Algorithms …”
Volltext

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

Inhaltsangabe: “… on Information Theory, 2022], which introduced the notion of basis reduction for codes, in analogy …”
Volltext

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

Inhaltsangabe: “… We present the first known pivot Gray code for spanning trees of complete graphs, listing all …”
Volltext