Results 271 to 280 of about 7,570 (298)
Some of the next articles are maybe not open access.
Generating cyclically permutable codes (Corresp.)
IEEE Transactions on Information Theory, 1974Large 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. E. Maracle, Charles T. Wolverton
openaire +1 more source
Computing the nucleolus of cyclic permutation games
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tamás Solymosi +2 more
openaire +2 more sources
Systematic Construction of Cyclically Permutable Code Words
IEEE Transactions on Communications, 1975A 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.
G. Robert Redinbo, John R. Wolcott
openaire +2 more sources
Encoding and Decoding for Cyclic Permutation Codes
IEEE Transactions on Electronic Computers, 1962Maximum-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
An algorithm to generate a random cyclic permutation
Information Processing Letters, 1986Abstract The purpose of this work is to present an algorithm to generate a random cyclic permutation. The proof of its correctness, the complexity and the results of the chi-square distribution test are given.
openaire +1 more source
The cyclic structure of random permutations
Mathematical Notes of the Academy of Sciences of the USSR, 1975Letα 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
Cyclically permutable error-correcting codes
IEEE Transactions on Information Theory, 1963zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Alternative developments of cyclic-permutation algorithms
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On decompositions of a cyclic permutation into a product of a given number of permutations
Functional Analysis and Its Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Cyclical functions and permutation matrices
Journal of the Franklin Institute, 1969Abstract 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