On quadratic residue codes and hyperelliptic curves

On quadratic residue codes and hyperelliptic curves

Show other versions (1)

Combinatorics

Bibliographic Details
Main Author:	David Joyner
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/429/pdf

Similar Items

On quadratic threshold CSPs
by: Per Austrin, et al.
Published: (2012-11-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

Directed figure codes are decidable
by: Michal Kolarz, et al.
Published: (2009-01-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

Gray code order for Lyndon words
by: Vincent Vajnovszki
Published: (2007-01-01)

On the residual solvability of generalized free products of solvable groups
by: Delaram Kahrobaei, et al.
Published: (2011-11-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

Secure frameproof codes through biclique covers
by: Hossein Hajiabolhassan, et al.
Published: (2012-12-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

On the number of maximal independent sets in a graph
by: David R. Wood
Published: (2011-09-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

Independent sets in graphs with an excluded clique minor
by: David R. Wood
Published: (2007-01-01)

On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Binary Labelings for Plane Quadrangulations and their Relatives
by: Stefan Felsner, et al.
Published: (2011-01-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

An optimal permutation routing algorithm on full-duplex hexagonal networks
by: Ignasi Sau, et al.
Published: (2008-01-01)

Shifts with decidable language and non-computable entropy
by: Peter Hertling, et al.
Published: (2008-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)

On symmetric structures of order two
by: Michel Bousquet, et al.
Published: (2008-01-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Multidimensional cellular automata and generalization of Fekete's lemma
by: Silvio Capobianco
Published: (2008-01-01)

Spanning forests on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2008-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Leftmost derivations of propagating scattered context grammars: a new proof
by: Tomáš Masopust, et al.
Published: (2008-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)