FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3117811306> ?p ?o ?g. }

• W3117811306 endingPage "48" @default.
• W3117811306 startingPage "1" @default.
• W3117811306 abstract "We give new constructions of two classes of algebraic code families that are efficiently list decodable with small output list size from a fraction 1-R-ε of adversarial errors, where R is the rate of the code, for any desired positive constant ε. The alphabet size depends only ε and is nearly optimal. The first class of codes are obtained by folding algebraic-geometric codes using automorphisms of the underlying function field. The second class of codes are obtained by restricting evaluation points of an algebraic-geometric code to rational points from a subfield . In both cases, we develop a linear-algebraic approach to perform list decoding, which pins down the candidate messages to a subspace with a nice “periodic” structure. To prune this subspace and obtain a good bound on the list size, we pick subcodes of these codes by pre-coding into certain subspace-evasive sets that are guaranteed to have small intersection with the sort of periodic subspaces that arise in our list decoding. We develop two approaches for constructing such subspace-evasive sets. The first is a Monte Carlo construction of hierearchical subspace-evasive (h.s.e.) sets that leads to excellent list size but is not explicit. The second approach exploits a further ultra-periodicity of our subspaces and uses a novel construct called subspace designs , which were subsequently constructed explicitly and also found further applications in pseudorandomness. To get a family of codes over a fixed alphabet size, we instantiate our approach with algebraic-geometric codes based on the Garcia–Stichtenoth tower of function fields. Combining this with pruning via h.s.e. sets yields codes list-decodable up to a 1-R-ε error fraction with list size bounded by O (1/ε), matching the existential bound for random codes up to constant factors. Further, the alphabet size can be made exp ( Õ (1/ε 2 )), which is not much worse than the lower bound of exp (Ω (1/ε)). The parameters we achieve are thus quite close to the existential bounds in all three aspects (error-correction radius, alphabet size, and list size) simultaneously. This construction is, however, Monte Carlo and the claimed list-decoding property only holds with high probability. Once the code is (efficiently) sampled, the encoding/decoding algorithms are deterministic with a running time O _ε ( N c ) for an absolute constant c , where N is the code’s block length. Using subspace designs instead for the pruning, our approach yields the first deterministic construction of an algebraic code family of rate R with efficient list decoding from 1-R-ε fraction of errors over an alphabet of constant size exp (Õ(1/ε 2 )). The list-size bound is upper bounded by a very slowly growing function of the block length N ; in particular, it is at most O(log ( r ) N ) (the r th iterated logarithm) for any fixed integer r . The explicit construction avoids the shortcoming of the Monte Carlo sampling at the expense of a slightly worse list size." @default.
• W3117811306 created "2021-01-05" @default.
• W3117811306 creator A5019628468 @default.
• W3117811306 creator A5068388812 @default.
• W3117811306 date "2022-01-31" @default.
• W3117811306 modified "2023-10-18" @default.
• W3117811306 title "Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes" @default.
• W3117811306 cites W1996118782 @default.
• W3117811306 cites W2013452229 @default.
• W3117811306 cites W2024417654 @default.
• W3117811306 cites W2032431003 @default.
• W3117811306 cites W2039908519 @default.
• W3117811306 cites W2052755788 @default.
• W3117811306 cites W2065853216 @default.
• W3117811306 cites W2068593329 @default.
• W3117811306 cites W2071364701 @default.
• W3117811306 cites W2083992035 @default.
• W3117811306 cites W2089272132 @default.
• W3117811306 cites W2100852839 @default.
• W3117811306 cites W2125835953 @default.
• W3117811306 cites W2133589924 @default.
• W3117811306 cites W2146078064 @default.
• W3117811306 cites W2159193690 @default.
• W3117811306 cites W2162725776 @default.
• W3117811306 cites W2165005000 @default.
• W3117811306 cites W2323514020 @default.
• W3117811306 cites W2399214554 @default.
• W3117811306 cites W2543082256 @default.
• W3117811306 cites W2608851625 @default.
• W3117811306 cites W2611959999 @default.
• W3117811306 cites W2962806708 @default.
• W3117811306 cites W2962891889 @default.
• W3117811306 cites W2963309538 @default.
• W3117811306 doi "https://doi.org/10.1145/3506668" @default.
• W3117811306 hasPublicationYear "2022" @default.
• W3117811306 type Work @default.
• W3117811306 sameAs 3117811306 @default.
• W3117811306 citedByCount "1" @default.
• W3117811306 countsByYear W31178113062020 @default.
• W3117811306 crossrefType "journal-article" @default.
• W3117811306 hasAuthorship W3117811306A5019628468 @default.
• W3117811306 hasAuthorship W3117811306A5068388812 @default.
• W3117811306 hasBestOaLocation W31178113062 @default.
• W3117811306 hasConcept C11413529 @default.
• W3117811306 hasConcept C114614502 @default.
• W3117811306 hasConcept C118615104 @default.
• W3117811306 hasConcept C12362212 @default.
• W3117811306 hasConcept C134306372 @default.
• W3117811306 hasConcept C157125643 @default.
• W3117811306 hasConcept C202444582 @default.
• W3117811306 hasConcept C204397858 @default.
• W3117811306 hasConcept C32834561 @default.
• W3117811306 hasConcept C33923547 @default.
• W3117811306 hasConcept C57273362 @default.
• W3117811306 hasConcept C78944582 @default.
• W3117811306 hasConcept C9376300 @default.
• W3117811306 hasConceptScore W3117811306C11413529 @default.
• W3117811306 hasConceptScore W3117811306C114614502 @default.
• W3117811306 hasConceptScore W3117811306C118615104 @default.
• W3117811306 hasConceptScore W3117811306C12362212 @default.
• W3117811306 hasConceptScore W3117811306C134306372 @default.
• W3117811306 hasConceptScore W3117811306C157125643 @default.
• W3117811306 hasConceptScore W3117811306C202444582 @default.
• W3117811306 hasConceptScore W3117811306C204397858 @default.
• W3117811306 hasConceptScore W3117811306C32834561 @default.
• W3117811306 hasConceptScore W3117811306C33923547 @default.
• W3117811306 hasConceptScore W3117811306C57273362 @default.
• W3117811306 hasConceptScore W3117811306C78944582 @default.
• W3117811306 hasConceptScore W3117811306C9376300 @default.
• W3117811306 hasIssue "2" @default.
• W3117811306 hasLocation W31178113061 @default.
• W3117811306 hasLocation W31178113062 @default.
• W3117811306 hasOpenAccess W3117811306 @default.
• W3117811306 hasPrimaryLocation W31178113061 @default.
• W3117811306 hasRelatedWork W1997558960 @default.
• W3117811306 hasRelatedWork W2035067291 @default.
• W3117811306 hasRelatedWork W2065530191 @default.
• W3117811306 hasRelatedWork W2167890515 @default.
• W3117811306 hasRelatedWork W2967356660 @default.
• W3117811306 hasRelatedWork W3195881199 @default.
• W3117811306 hasRelatedWork W4229082471 @default.
• W3117811306 hasRelatedWork W4286911979 @default.
• W3117811306 hasRelatedWork W4297890314 @default.
• W3117811306 hasRelatedWork W4308161930 @default.
• W3117811306 hasVolume "69" @default.
• W3117811306 isParatext "false" @default.
• W3117811306 isRetracted "false" @default.
• W3117811306 magId "3117811306" @default.
• W3117811306 workType "article" @default.