Results 261 to 270 of about 6,509 (277)

Generating cyclically permutable codes (Corresp.)

IEEE Transactions on Information Theory, 1974
Large sets of cyclically permutable (or cyclically inequivalent) codewords can be created by interleaving the cyclic shifts of several shorter words and selecting a cyclically inequivalent subset from the resulting set, This correspondence presents an efficient algorithm for generating the cyclically inequivalent subset directly.
D. Maracle, C. Wolverton
openaire   +1 more source

Systematic Construction of Cyclically Permutable Code Words

IEEE Transactions on Communications, 1975
A numerical procedure for determining the cyclically permutable code of any length over an arbitrary alphabet is outlined. This method is easily programmed on a digital computer. A formula for the Hamming weight distribution of the code is also given.
Redinbo, G. Robert, Wolcott, John R.
openaire   +2 more sources

Cyclical functions and permutation matrices

Journal of the Franklin Institute, 1969
Abstract Cyclical functions are an extension of the concept of hyperbolic functions. These functions have many interesting and important properties. This paper develops the theory of these functions from a novel point of view by using the properties of permutation matrices. The connection between cyclical functions and the matrix exponential function
openaire   +2 more sources

Cyclically permutable error-correcting codes

IEEE Transactions on Information Theory, 1963
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The cyclic structure of random permutations

Mathematical Notes of the Academy of Sciences of the USSR, 1975
Letα r denote the number of cycles of length r in a random permutation, taking its values with equal probability from among the set Sn of all permutations of length n. In this paper we study the limiting behavior of linear combinations of random permutationsα 1, ...,α r having the form
Kolchin, V. F., Chistyakov, V. P.
openaire   +2 more sources

“Digital” Entropy Induced by Unimodal Cyclic Permutations

Bulletin of the Malaysian Mathematical Sciences Society, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Modular Vector Invariants of Cyclic Permutation Representations

Canadian Mathematical Bulletin, 1999
AbstractVector invariants of finite groups (see the introduction for an explanation of the terminology) have often been used to illustrate the difficulties of invariant theory in the modular case: see, e.g., [1], [2], [4], [7], [11] and [12]. It is therefore all the more surprising that the unpleasant properties of these invariants may be derived from ...
openaire   +2 more sources

Encoding and Decoding for Cyclic Permutation Codes

IEEE Transactions on Electronic Computers, 1962
Maximum-likelihood encoding and decoding procedures are presented for cyclic permutation error-correcting codes. These procedures take advantage of the cyclic permutation structure, and are applicable to all such codes. On the other hand, familiar parity-checking procedures are applicable only to those few cyclic permutation codes which are group codes.
openaire   +1 more source

Alternative developments of cyclic-permutation algorithms

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Cyclic-Symmetric Permutations

Journal of the London Mathematical Society, 1975
openaire   +2 more sources