Vince Grolmusz  Home/Search
Context Related
| cs.elte.hu/~grolmusz/pape...CODETR2.PS Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.elte.hu/~grolmusz (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The main problem of coding theory is to construct codes with large Hamming-distances between the code-words. In this work we describe a fast algorithm for generating pairs of q-ary codes with prescribed pairwise Hamming-distances and coincidences (for a letter s 2 f0; 1; : : : ; q \Gamma 1g, the number of s-coincidences between codewords a and b is the number of letters s in the same positions both in a and b). The method is a generalization of a method for constructing set-systems with... (Update)
Context of citations to this paper: More
.... to apply a multivariate polynomial f to our rectangle cover in a very similar wayaswe applied polynomials to set systems in [11] and to codes in [12]: Definition 10 Let R 1 #R 2 #: #R h bearectangle cover of a matrix M = fx i y j g, and let f be a h variable multi linear...
Cited by: More
Computing Elementary Symmetric Polynomials with a Sub-Polynomial .. - Grolmusz (2002) (Correct)
Similar documents based on text: More All
1.6: Constructing Set-Systems with Prescribed Intersection Sizes - Grolmusz (2001) (Correct)
1.1: A Trade-Off for Covering the Off-Diagonal Elements of Matrices - Grolmusz (Correct)
1.0: k-wise Set-Intersections and k-wise Hamming-Distances - Grolmusz, Sudakov (2001) (Correct)
Related documents from co-citation: More All
6: An Exponential Lower Bound for Depth 3 Arithmetic Circuits - Grigoriev, Karpinski - 1998
3: into complete bipartite graphs (context) - Tverberg, decomposition - 1982
3: Multiplication of multidigit numbers on automata (context) - Karatsuba, Ofman - 1963
BibTeX entry: (Update)
V. Grolmusz. Pairs of codes with prescribed hamming distances and coincidences. Technical Report DIMACS TR 2002-9, DIMACS, February 2002. http://citeseer.ist.psu.edu/grolmusz02pairs.html More
@misc{ grolmusz02pairs,
author = "V. Grolmusz",
title = "Pairs of codes with prescribed hamming distances and coincidences",
text = "V. Grolmusz. Pairs of codes with prescribed hamming distances and coincidences.
Technical Report DIMACS TR 2002-9, DIMACS, February 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/grolmusz02pairs.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.cs.elte.hu/~grolmusz): More
The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal - Grolmusz (1994) (Correct)
Harmonic Analysis, Real Approximation, and the Communication.. - Grolmusz (1996) (Correct)
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits - Grolmusz (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC