Sökning: "perfect codes"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden perfect codes.

  1. 1. A study on mixed perfect codes

    Författare :Olof Heden; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  3. 2. Parity check systems, perfect codes and codes over Frobenius rings

    Författare :Thomas Westerbäck; Olof Heden; Patric Östergård; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consists of five papers related to coding theory. The first four papers are mainly devoted to perfect 1-error correcting binary codes. The fifth paper concerns codes over finite Abelian groups and finite commutative Frobenius rings. In Paper A we construct a new class of perfect binary codes of length 15. LÄS MER

  4. 3. Superimposed codes for additive channels

    Författare :Danyo Danev; Linköpings universitet; []
    Nyckelord :;

    Sammanfattning : We consider a situation where several users send information over a single additive channel. We suppose the transmission is synchronized and that at most m of the total number of potential T users transmit simultaneously. The receiver gets a message which is the sum of the messages of the active users at that moment. LÄS MER

  5. 4. Ternary Codes with Weight Constraints

    Författare :Mattias Svanström; Faina Solovieva; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We study the problem of maximizing the size of a ternary block code with given length and minimum Hamming distance. The problem is further restricted in two different ways. Either we require all codewords to have constant Hamming weight, or we require all codewords to have constant composition. LÄS MER

  7. 5. Optimization, Matroids and Error-Correcting Codes

    Författare :Martin Hessler; Johan Wästlund; Olof Heden; Faina I. Solov´eva; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs. LÄS MER