A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
List decoding codes on Garcia–Stictenoth tower using Gröbner basis
2009
Journal of symbolic computation
Preserved Fulltext
The procedure for root-finding of the interpolation polynomial going modulo a large degree place is described from the tower point of view. ...
An account of the interpolation and the root-finding steps of list decoding of one-point codes is given. ...
Acknowledgments The first author was a researcher at Indian Statistical Institute, Kolkata, when the research reported in this work was carried out. ...
doi:10.1016/j.jsc.2008.02.004
fatcat:rnw3mkth7rfg7m62zx6j4e6ayy
Constructions of Codes from Number Fields
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
I thank Amin Shokrollahi for crucial pointers to prior work on number field codes. ...
I am grateful to Michael Tsfasman and Serge Vlȃdut for pointers to [20, 21] and for sending me a copy of their paper [21] (which was crucial in simplifying some of my asymptotically good code constructions ...
An algebraic error-correcting code is defined based on an underlying ring (assume it is an integral domain) whose elements ¡ come equipped with some notion of "size", denoted
Constructing Codes from ...
doi:10.1007/3-540-45624-4_14
fatcat:rkqhlpumnva4hm7xycjju74vcq
Constructions of codes from number fields
2003
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
I thank Amin Shokrollahi for crucial pointers to prior work on number field codes. ...
I am grateful to Michael Tsfasman and Serge Vlȃdut for pointers to [20, 21] and for sending me a copy of their paper [21] (which was crucial in simplifying some of my asymptotically good code constructions ...
An algebraic error-correcting code is defined based on an underlying ring (assume it is an integral domain) whose elements ¡ come equipped with some notion of "size", denoted
Constructing Codes from ...
doi:10.1109/tit.2002.808131
fatcat:grwsdn7m2bcezdcboev2c33trm
Page 3149 of Mathematical Reviews Vol. , Issue 2003d
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “An iterative algorithm is given for producing the parity-check functions for one-point algebraic-geometry codes, in particular (but not limited to) those related to the two towers of function ...
The proof follows by estimating the number of effective F,2-rational divisors on a Hermitian curve from its zeta function, and no explicit examples of a divisor G that yields an improved code are given ...
Curves over Finite Fields and Codes
[chapter]
2001
European Congress of Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper gives a review of recent developments in this field and discusses some questions. ...
To a linear code one can associate the pair (δ = d/n, R = k/n) ∈ [0, 1] 2 of relative parameters. Let U lin q be the set of limit points of the set of all such pairs coming from linear codes. ...
of the function field F q (X) such that no f ∈ L has a pole in the points P i we can define an evaluation map α : L → F n q , f → (f (P i ) n i=1 ) . ...
doi:10.1007/978-3-0348-8266-8_18
fatcat:s64g45d3wvas3mw6lb7nbo6ydq
Optimal rate list decoding over bounded alphabets using algebraic-geometric codes
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The second class of codes are obtained by restricting evaluation points of an algebraic-geometric code to rational points from a subfield. ...
The first class of codes are obtained by folding algebraic-geometric codes using automorphisms of the underlying function field. ...
We are grateful to the anonymous reviewers for detailed and perceptive comments which led to significant improvements in the organization and presentation of the paper. ...
arXiv:1708.01070v2
fatcat:pg74jht3lnbn5ht7fufvlmqfq4
Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our construction is based on a linear-algebraic approach to list decoding folded codes from towers of function fields, and combining it with a special form of subspace-evasive sets. ...
Along the way, we shed light on how to use automorphisms of certain function fields to enable list decoding of the folded version of the associated algebraic-geometric codes. ...
Folded codes from the Hermitian tower In this section, we will describe a family of folded codes based on the Hermitian function field (or rather a tower of such fields). ...
arXiv:1204.4209v1
fatcat:354tuk4k4zbb5ggzsez6dkz7gy
Codes for solar flux calculation dedicated to central receiver system applications: A comparative review
2008
Solar Energy
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
As we need adapted software to calculate the solar flux concentration through a tower-heliostat field system, an overview of computer codes was performed, detailing their features, strengths and weaknesses ...
A bibliographic study on first generation and developing codes complements this overview of tools that may be interesting for CSP research or industry. ...
from CRAL -Observatoire de Lyon, Manuel Blanco from University of Texas, Lorin Vant-Hull from University of Houston and Rafaele Bolliger from EPFL-LENI for their invaluable help. ...
doi:10.1016/j.solener.2007.08.004
fatcat:kvstcgkoz5gipgb3acsbz34bum
Typhoon inversion method combined with the YanMeng wind field and a meteorological monitoring system for transmission lines
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENTS The authors acknowledge the financial support provided by the Natural Science Foundation of China (51675179) and the science and technology project of State Grid Corporation of China (SGHEBD00FCJS2000217 ...
Therefore it's hard to apply them on evaluating the transmission towers' wind resistance performance. The other approach is numerical simulation based on typhoon wind field model. ...
However, whether collapse phenomenon happens not only depends on wind load applied, but also the capacity of towers, which varies a lot from one to another. ...
doi:10.1109/access.2020.3044419
fatcat:oqrhg5s6r5fqbclajza7ajnqwy
The arithmetic codex
2012
2012 IEEE Information Theory Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
It is intriguing that their construction requires asymptotically good towers of algebraic function fields over a finite field: no elementary (probabilistic) constructions are known in these cases. ...
complexity (bilinear complexity of multiplication in algebras) in a single mathematical framework. ...
Our notion of torsion limit of a tower of function fields introduced in [8] captures the combination. ...
doi:10.1109/itw.2012.6404767
dblp:conf/itw/CascudoCX12
fatcat:kkzuoif2xbfjfgcabhmp7clu6e
Deep Claim: Payer Response Prediction from Claims Data with Deep Learning
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
With the cost to recover these denials and underpayments, predicting payer response (likelihood of payment) from claims data with a high degree of accuracy and precision is anticipated to improve healthcare ...
Built on this new latent representation, we demonstrate that a deep learning-based framework, Deep Claim, can accurately predict various responses from multiple payers using 2,905,026 de-identified claims ...
Acknowledgements We thank Woosang Lim for helpful conversations on a lowrank bilinear pooling layer. ...
arXiv:2007.06229v1
fatcat:qvxvznszebbbtfh7gegowddw3u
Strategies in tower solar power plant optimization
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We describe a method to evaluate the impact of design variables in the plant performance. ...
We parametrize the plant design as a function of eleven design variables and reduce the problem of finding optimal designs to the numerical problem of finding the minimum of a function of several variables ...
Figure 5 : Field layout of a plant with a tower with three receivers. One of them points to the north, and the others at 120 o . ...
arXiv:1205.3059v1
fatcat:mr65dtzjkbhqnfahtbgwhum5oy
Constructions of maximally recoverable local reconstruction codes via function fields
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. ...
For the case of a=1 (one local parity check), we improve the field size quadratically from r^h(h+1) to r^h (h+1)/2 for some range of r. ...
The other s 3/2 places come from the F s -rational places lying over the unique zero P α of x − α for each evaluated at P we get a value in the residue field OP /P -one can think of the coordinates of ...
arXiv:1808.04539v1
fatcat:ehkfdtpigvdnzkroyzq2g54yuu
Application of the lifting line vortex wake method to dynamic load case simulations
2016
Journal of Physics, Conference Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since the free vortex wake simulations come at a substantial increase of CPU-time, a hybrid approach prescribing the far wake is shown to offer a promising compromise. ...
Within the EU AVATAR project, the added benefit of using the vortex line method is researched by calculating aero-elastic response for a variety of IEC load cases. ...
of time (c) Chord normal force at 82%R as a function of time (d) Flapwise blade root moment (from pressures) as a function of time
Figure 9 . 9 Simulation results for the pitch step case, Mexico rotor ...
doi:10.1088/1742-6596/753/2/022030
fatcat:csxwmztvcndlhoarcc6dobpifa
Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
asymptotically good towers of function fields. ...
Asymptotically good sequences of ramp secret sharing schemes were given in [Asymptotically good ramp secret sharing schemes, arXiv:1502.05507] by using one-point algebraic geometric codes defined from ...
In [4] it was discussed how to obtain asymptotically good sequences of ramp secret sharing schemes by using one-point algebraic geometric codes defined from asymptotically good towers of function fields ...
arXiv:1511.06230v1
fatcat:h3xxmwiy2zbt3nxlby3cxt7voq
« Previous
Showing results 1 — 15 out of 32,592 results