Skip header Section
Skip Bibliometrics Section
Algebraic-Geometric CodesJune 1991
- Authors:
- M.A. A. Tsfasman,
- S.G. Vladut
Abstract
No abstract available.
Cited By
- Niu X, Xing C and Yuan C (2020). Asymptotic Gilbert–Varshamov Bound on Frequency Hopping Sequences, IEEE Transactions on Information Theory, 66:2, (1213-1218), Online publication date: 1-Feb-2020.
- Micheli G and Neri A (2020). New Lower Bounds for Permutation Codes Using Linear Block Codes, IEEE Transactions on Information Theory, 66:7, (4019-4025), Online publication date: 1-Jul-2020.
- Jin L, Ma L and Xing C (2019). Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields, IEEE Transactions on Information Theory, 66:1, (210-221), Online publication date: 1-Jan-2020.
- Cramer R, Xing C and Yuan C (2019). Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex, IEEE Transactions on Information Theory, 66:1, (263-272), Online publication date: 1-Jan-2020.
- Jin L, Kan H and Zhang Y (2019). Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields, IEEE Transactions on Information Theory, 66:1, (202-209), Online publication date: 1-Jan-2020.
- Randriam H (2019). Gaps between prime numbers and tensor rank of multiplication in finite fields, Designs, Codes and Cryptography, 87:2-3, (627-645), Online publication date: 1-Mar-2019.
- Ballet S and Zykin A (2019). Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields, Designs, Codes and Cryptography, 87:2-3, (517-525), Online publication date: 1-Mar-2019.
- Li X, Ma L and Xing C (2018). Optimal Locally Repairable Codes Via Elliptic Curves, IEEE Transactions on Information Theory, 65:1, (108-117), Online publication date: 1-Jan-2019.
- Hu C and Yang S (2018). Multi-point codes over Kummer extensions, Designs, Codes and Cryptography, 86:1, (211-230), Online publication date: 1-Jan-2018.
- Jin L and Xing C (2018). Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound, IEEE Transactions on Information Theory, 64:9, (6277-6282), Online publication date: 1-Sep-2018.
- Bartoli D, Montanucci M and Zini G (2018). Multi point AG codes on the GK maximal curve, Designs, Codes and Cryptography, 86:1, (161-177), Online publication date: 1-Jan-2018.
- Polyanskiy Y (2017). On metric properties of maps between Hamming spaces and related graph homomorphisms, Journal of Combinatorial Theory Series A, 145:C, (227-251), Online publication date: 1-Jan-2017.
- Guruswami V, Jin L and Xing C (2017). Efficiently List-Decodable Punctured Reed-Muller Codes, IEEE Transactions on Information Theory, 63:7, (4317-4324), Online publication date: 1-Jul-2017.
- Tzanakis G, Moura L, Panario D and Stevens B (2017). Covering arrays from m-sequences and character sums, Designs, Codes and Cryptography, 85:3, (437-456), Online publication date: 1-Dec-2017.
Han S, Liu S, Zhang F and Chen K Homomorphic Linear Authentication Schemes from (ε)-Authentication Codes Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, (487-498)- Ben-Sasson E, Kaplan Y, Kopparty S, Meir O and Stichtenoth H (2016). Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity, Journal of the ACM, 63:4, (1-57), Online publication date: 8-Nov-2016.
- Sepulveda Castellanos A and Tizziotti G (2016). Two-Point AG Codes on the GK Maximal Curves, IEEE Transactions on Information Theory, 62:2, (681-686), Online publication date: 1-Feb-2016.
- Yang S, Wu H and Li J (2016). Access structures of hyperelliptic secret sharing schemes, Finite Fields and Their Applications, 37:C, (46-53), Online publication date: 1-Jan-2016.
- Lingfei Jin (2015). A New Construction of Block Codes From Algebraic Curves, IEEE Transactions on Information Theory, 61:8, (4239-4242), Online publication date: 1-Aug-2015.
- Farran J and Garcia-Sanchez P (2015). The Second Feng-Rao Number for Codes Coming From Inductive Semigroups, IEEE Transactions on Information Theory, 61:9, (4938-4947), Online publication date: 1-Sep-2015.
- Sha M (2015). On the lattices from elliptic curves over finite fields, Finite Fields and Their Applications, 31:C, (84-107), Online publication date: 1-Jan-2015.
- Wood J (2014). Relative one-weight linear codes, Designs, Codes and Cryptography, 72:2, (331-344), Online publication date: 1-Aug-2014.
- Berg J and Wakefield M (2014). Skeleton simplicial evaluation codes, Designs, Codes and Cryptography, 72:3, (609-625), Online publication date: 1-Sep-2014.
- Ben-Sasson E, Gabizon A, Kaplan Y, Kopparty S and Saraf S A new family of locally correctable codes based on degree-lifted algebraic geometry codes Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, (833-842)
- Cohen G, Mesnager S and Patey A On Minimal and Quasi-minimal Linear Codes Proceedings of the 14th IMA International Conference on Cryptography and Coding - Volume 8308, (85-98)
- Wu X and Liew A Near-Optimal Collusion-Secure Fingerprinting Codes for Efficiently Tracing Illegal Re-distribution Cyberspace Safety and Security, (352-361)
- Kopparty S (2011). Review of algebraic function fields and codes by Henning Stichtenoth, ACM SIGACT News, 42:2, (19-24), Online publication date: 10-Jun-2011.
- Chen H Efficient compromising resilient authentication schemes for large scale wireless sensor networks Proceedings of the third ACM conference on Wireless network security, (49-54)
- Wang L, Feng K, Ling S and Xing C (2010). Asymmetric quantum codes, IEEE Transactions on Information Theory, 56:6, (2938-2945), Online publication date: 1-Jun-2010.
- Ling S, Luo J and Xing C (2010). Generalization of Steane's enlargement construction of quantum codes and applications, IEEE Transactions on Information Theory, 56:8, (4080-4084), Online publication date: 1-Aug-2010.
- Glass D, Joyner D and Ksir A (2010). Codes from Riemann-Roch spaces for y 2/ = xp; - x over GF(p), International Journal of Information and Coding Theory, 1:3, (298-312), Online publication date: 1-Apr-2010.
- Fanali S and Giulietti M (2010). One-point AG codes on the GK maximal curves, IEEE Transactions on Information Theory, 56:1, (202-210), Online publication date: 1-Jan-2010.
- Yang S (2009). Improvements on parameters of algebraic-geometry codes from Hermitian curves, IEEE Transactions on Information Theory, 55:1, (105-108), Online publication date: 1-Jan-2009.
- Klyachko A and ÖZen İ (2009). Correlations between the ranks of submatrices and weights of random codes, Finite Fields and Their Applications, 15:4, (497-516), Online publication date: 1-Aug-2009.
- Chen H, Cramer R, De Haan R and Pueyo I Strongly multiplicative ramp schemes from high degree rational points on curves Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology, (451-470)
- Bracco A, Natividad A and Solé P (2008). On quintic quasi-cyclic codes, Discrete Applied Mathematics, 156:18, (3362-3375), Online publication date: 1-Nov-2008.
- Ling S and Özbudak F (2007). Constructions and bounds on linear error-block codes, Designs, Codes and Cryptography, 45:3, (297-316), Online publication date: 1-Dec-2007.
- Asamov T and Aydin N (2007). A search algorithm for linear codes, Designs, Codes and Cryptography, 45:2, (213-217), Online publication date: 1-Nov-2007.
- Fernandez M and Cotrina J Obtaining asymptotic fingerprint codes through a new analysis of the boneh-shaw codes Proceedings of the Second SKLOIS conference on Information Security and Cryptology, (289-303)
- Chen H and Cramer R Algebraic geometric secret sharing schemes and secure multi-party computations over small fields Proceedings of the 26th annual international conference on Advances in Cryptology, (521-536)
- Homma M and Kim S (2005). Toward the Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve, Designs, Codes and Cryptography, 37:1, (111-132), Online publication date: 1-Oct-2005.
- Spera A (2005). Asymptotically Good Codes from Generalized Algebraic-Geometry Codes, Designs, Codes and Cryptography, 37:2, (305-312), Online publication date: 1-Nov-2005.
- Joyner D (2005). Conjectural permutation decoding of some AG codes, ACM SIGSAM Bulletin, 39:1, (26-32), Online publication date: 1-Mar-2005.
- Kroll H and Vincenti R (2005). PD-sets for the codes related to some classical varieties, Discrete Mathematics, 301:1, (89-105), Online publication date: 1-Sep-2005.
- Mullen G (2005). Editorial, Finite Fields and Their Applications, 11:3, (321-325), Online publication date: 1-Aug-2005.
- Garcia A and Stichtenoth H (2005). Asymptotics for the genus and the number of rational places in towers of function fields over a finite field, Finite Fields and Their Applications, 11:3, (434-450), Online publication date: 1-Aug-2005.
- Abatangelo V and Larato B (2005). Near-MDS codes arising from algebraic curves, Discrete Mathematics, 301:1, (5-19), Online publication date: 1-Sep-2005.
- Barg A and Kabatiansky G (2004). A class of I.P.P. codes with efficient identification, Journal of Complexity, 20:2-3, (137-147), Online publication date: 1-Apr-2004.
- Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
- Janwa H Good expander graphs and expander codes Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes, (119-128)
- Bouganis T and Coles D A geometric view of decoding AG codes Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes, (180-190)
- Bouganis T Error correcting codes over algebraic surfaces Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes, (169-179)
- Farrán J and Munuera C (2003). Goppa-like bounds for the generalized Feng--Rao distances, Discrete Applied Mathematics, 128:1, (145-156), Online publication date: 15-May-2003.
- Giulietti M, Pambianco F, Torres F and Ughi E (2002). On Complete Arcs Arising from Plane Curves, Designs, Codes and Cryptography, 25:3, (237-246), Online publication date: 1-Mar-2002.
- Elkies N Excellent codes from modular curves Proceedings of the thirty-third annual ACM symposium on Theory of computing, (200-208)
- Beelen P and Pellikaan R (2000). The Newton Polygon of Plane Curves with Many Rational Points, Designs, Codes and Cryptography, 21:1-3, (41-67), Online publication date: 1-Oct-2000.
- Dumer I, Micciancio D and Sudan M Hardness of Approximating the Minimum Distance of a Linear Code Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Shokrollahi M and Wasserman H Decoding algebraic-geometric codes beyond the error-correction bound Proceedings of the thirtieth annual ACM symposium on Theory of computing, (241-248)
- Bierbrauer J (1997). Universal Hashing and Geometric Codes, Designs, Codes and Cryptography, 11:3, (207-221), Online publication date: 1-Jul-1997.
- Faldum A and Willems W (1997). Codes of Small Defect, Designs, Codes and Cryptography, 10:3, (341-350), Online publication date: 1-Mar-1997.
- Vardy A Algorithmic complexity in coding theory and the minimum distance problem Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (92-109)
- Boer M (1996). Almost MDS Codes, Designs, Codes and Cryptography, 9:2, (143-155), Online publication date: 1-Oct-1996.
- Janwa H and Moreno O (1996). McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes, Designs, Codes and Cryptography, 8:3, (293-307), Online publication date: 1-Aug-1996.
- Walker J (1996). A New Approach to the Main Conjecture on Algebraic-Geometric MDS Codes, Designs, Codes and Cryptography, 9:1, (115-120), Online publication date: 11-Aug-1996.
- Vladut S (1996). Two applications of Weil-Serre's explicit formula, Applicable Algebra in Engineering, Communication and Computing, 7:4, (279-288), Online publication date: 1-Jul-1996.
- Lachaud G and Stern J (1992). Polynomial-time construction of codes I, Applicable Algebra in Engineering, Communication and Computing, 3:2, (151-161), Online publication date: 1-Jun-1992.
Recommendations
Algebraic analog decoding of linear binary codes
Bit-by-bit soft-decision decoding of binary cyclic codes is considered. A significant reduction in decoder complexity can be achieved by requiring only that the decoder correct all analog error patterns which fall within a Euclidean sphere whose radius ...