New Codes from Old; A New Geometric Construction

AbstractWe describe a new technique for obtaining new codes from old ones using geometric methods. Several applications are described

Toward a Semiotic Framework for Using Technology in Mathematics Education: The Case of Learning 3D Geometry

This paper proposes and examines a semiotic framework to inform the use of technology in mathematics education. Semiotics asserts that all cognition is irreducibly triadic, of the nature of a sign, fallible, and thoroughly immersed in a continuing process of interpretation (Halton, 1992). Mathematical meaning-making or meaningful knowledge construction is a continuing process of interpretation within multiple semiotic resources including typological, topological, and social-actional resources. Based on this semiotic framework, an application named VRMath has been developed to facilitate the learning of 3D geometry. VRMath utilises innovative virtual reality (VR) technology and integrates many semiotic resources to form a virtual reality learning environment (VRLE) as well as a mathematical microworld (Edwards, 1995) for learning 3D geometry. The semiotic framework and VRMath are both now being evaluated and will be re-examined continuously

Design codes and design language

Self-funde

List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes

We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amor\'os and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil (2008) that has not been done in the original proposal except for one-point Hermitian codes, remove the unnecessary computational steps so that it can run faster, and analyze its computational complexity in terms of multiplications and divisions in the finite field. As a unique decoding algorithm, the proposed one is empirically and theoretically as fast as the BMS algorithm for one-point Hermitian codes. As a list decoding algorithm, extensive experiments suggest that it can be much faster for many moderate size/usual inputs than the algorithm by Beelen and Brander (2010). It should be noted that as a list decoding algorithm the proposed method seems to have exponential worst-case computational complexity while the previous proposals (Beelen and Brander, 2010; Guruswami and Sudan, 1999) have polynomial ones, and that the proposed method is expected to be slower than the previous proposals for very large/special inputs.Comment: Accepted for publication in J. Symbolic Computation. LaTeX2e article.cls, 42 pages, 4 tables, no figures. Ver. 6 added an illustrative example of the algorithm executio