Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coordinate-ordering-free Upper Bounds for Linear Insertion-Deletion
  Codes   The insertion-deletion codes were motivated to correct the synchronization
errors. In this paper we prove several coordinate-ordering-free upper bounds on
the insdel distances of linear codes, which are based on the generalized
Hamming weights and the formation of minimum Hamming weight codewords. Our
bounds are stronger than some previous known bounds. We apply these upper
bounds to some cyclic codes and one algebraic-geometric code with any
rearrangement of coordinate positions. Some strong upper bounds on the insdel
distances of Reed-Muller codes with special coordinate-ordering are also given.

35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
30
The categories of this paper are: q-alg