COMBINATORICS 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMBINATORICS-1998 Paper

click to vote

COMBINATORICS
1998

130views more COMBINATORICS 1998»

Codes and Projective Multisets

13 years 4 months ago

Download www.maths.tcd.ie

The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...

Stefan M. Dodunekov, Juriaan Simonis

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	130	Codes and Projective Multisets	claim
2	113	A Multivariate Lagrange Inversion Formula for Asymptotic Calculations	claim
3	103	Recognizing Circulant Graphs of Prime Order in Polynomial Time	claim
4	102	Inclusion-Exclusion and Network Reliability	claim
5	100	Lattice Paths Between Diagonal Boundaries	claim
6	99	Constructions for Cubic Graphs with Large Girth	claim
7	99	On Minimal Words With Given Subword Complexity	claim
8	93	Durfee Polynomials	claim
9	91	New Bounds for Union-free Families of Sets	claim
10	89	Venn Diagrams with Few Vertices	claim
11	88	Multi-statistic enumeration of two-stack sortable permutations	claim
12	88	A Bijective Proof of Garsia's q-Lagrange Inversion Theorem	claim
13	87	Crooked Functions, Bent Functions, and Distance Regular Graphs	claim
14	86	Lattice Tilings by Cubes: Whole, Notched and Extended	claim
15	84	Multimatroids II. Orthogonality, minors and connectivity	claim
16	81	An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs	claim
17	80	Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks	claim
18	80	Increasing Subsequences and the Classical Groups	claim
19	79	A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments	claim
20	77	Permutations which are the Union of an Increasing and a Decreasing Subsequence	claim
21	76	An Exploration of the Permanent-Determinant Method	claim
22	71	New Symmetric Designs from Regular Hadamard Matrices	claim
23	66	Combinatorial Aspects of Multiple Zeta Values	claim
24	66	Some New Ramsey Colorings	claim
25	65	A Construction for Sets of Integers with Distinct Subset Sums	claim
26	64	Another Infinite Sequence of Dense Triangle-Free Graphs	claim
27	63	On Kissing Numbers in Dimensions 32 to 128	claim
28	62	A Note on the Asymptotics and Computational Complexity of Graph Distinguishability	claim
29	61	A Macdonald Vertex Operator and Standard Tableaux Statistics	claim
30	60	Finite Vector Spaces and Certain Lattices	claim
31	54	The Permutation Classes Equinumerous to the Smooth Class	claim
32	54	Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles	claim
33	51	Minimal Cycle Bases of Outerplanar Graphs	claim
34	42	On Noncrossing and Nonnesting Partitions for Classical Reflection Groups	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers