1,524 research outputs found

    The Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over F3

    Full text link
    Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the determination of the weight distributions of cyclic codes with few nonzeros, by using quadratic form and exponential sum but limited to low moments. In this paper, we focus on the application of higher moments of the exponential sum to determine the weight distributions of a class of ternary cyclic codes with three nonzeros, combining with not only quadratic form but also MacWilliams' identities. Another application of this paper is to emphasize the computer algebra system Magma for the investigation of the higher moments. In the end, the result is verified by one example using Matlab.Comment: 10 pages, 3 table

    Laplacian spectral characterization of some double starlike trees

    Full text link
    A tree is called double starlike if it has exactly two vertices of degree greater than two. Let H(p,n,q)H(p,n,q) denote the double starlike tree obtained by attaching pp pendant vertices to one pendant vertex of the path PnP_n and qq pendant vertices to the other pendant vertex of PnP_n. In this paper, we prove that H(p,n,q)H(p,n,q) is determined by its Laplacian spectrum

    Spectral characterizations of propeller graphs

    Full text link
    A propeller graph is obtained from an ∞\infty-graph by attaching a path to the vertex of degree four, where an ∞\infty-graph consists of two cycles with precisely one common vertex. In this paper, we prove that all propeller graphs are determined by their Laplacian spectra as well as their signless Laplacian spectra
    • …
    corecore