117,628 research outputs found

    The Intersection problem for 2-(v; 5; 1) directed block designs

    Get PDF
    The intersection problem for a pair of 2-(v, 3, 1) directed designs and 2-(v, 4, 1) directed designs is solved by Fu in 1983 and by Mahmoodian and Soltankhah in 1996, respectively. In this paper we determine the intersection problem for 2-(v, 5, 1) directed designs.Comment: 17 pages. To appear in Discrete Mat

    Problems on q-Analogs in Coding Theory

    Full text link
    The interest in qq-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and combinatorial coding problems concerning these q-analogs which remained unsolved. The first goal of this paper is to make a short summary of the large amount of research which was done in the area mainly in the last few years and to provide most of the relevant references. The second goal of this paper is to present one hundred open questions and problems for future research, whose solution will advance the knowledge in this area. The third goal of this paper is to present and start some directions in solving some of these problems.Comment: arXiv admin note: text overlap with arXiv:0805.3528 by other author

    Coding Theory and Algebraic Combinatorics

    Full text link
    This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. We describe and recapitulate important results in the development of the state of the art. In addition, we give illustrative examples and constructions, and highlight recent advances. Finally, we provide a collection of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in Information and Coding Theory", ed. by I. Woungang et al., World Scientific, Singapore, 201

    Periodicity of certain piecewise affine planar maps

    Get PDF
    We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for λ∈{±1±52,±2,±3}\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\} that all integer sequences (ak)k∈Z(a_k)_{k\in\mathbb Z} satisfying 0≤ak−1+λak+ak+1<10\le a_{k-1}+\lambda a_k+a_{k+1}<1 are periodic
    • …
    corecore