Complete Variable-Length Codes: An Excursion into Word Edit Operations
Given an alphabet A and a binary relation $\tau$ $\subseteq$ A * x A * , a language X $\subseteq$ A * is $\tau$-independent if $\tau$ (X) $\cap$ X = $\emptyset$; X is $\tau$-closed if $\tau$ (X) $\subseteq$ X. The language X is complete if any word over A is a factor of some concatenation of words in X. Given a family of languages F containing X, X is maximal in F if no other set of F can stricly contain X. A language X $\subseteq$ A * is a variable-length code if any equation among the words of X is necessarily trivial. The study discusses the relationship between maximality and completeness in the case of $\tau$-independent or $\tau$-closed variable-length codes. We focus to the binary relations by which the images of words are computed by deleting, inserting, or substituting some characters.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Towards Accurate Image Coding: Improved Autoregressive Image Generation with Dynamic Vector Quantization
Existing vector quantization (VQ) based autoregressive models follow a two-stage generation paradigm that first learns a codebook to encode images as discrete codes, and then completes generation based on the learned cod…
Image GenerationPositionQuantizationDeep Learning-Based Decoding of Constrained Sequence Codes
Constrained sequence (CS) codes, including fixed-length CS codes and variable-length CS codes, have been widely used in modern wireless communication and data storage systems. Sequences encoded with constrained sequence …
Deep LearningLevel crossing statistics in a biologically motivated model of a long dynamic protrusion: passage times, random and extreme excursions
Long cell protrusions, which are effectively one-dimensional, are highly dynamic subcellular structures. Length of many such protrusions keep fluctuating about the mean value even in the the steady state. We develop here…
Variable-Length Hashing
Hashing has emerged as a popular technique for large-scale similarity search. Most learning-based hashing methods generate compact yet correlated hash codes. However, this redundancy is storage-inefficient. Hence we prop…
Code SearchRetrievalVariable-Length Codes Independent or Closed with respect to Edit Relations
We investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewo…
Information RetrievalRetrieval