On some connections between permutations and coding

DOI10.1016/0012-365X(85)90022-6zbMath0579.94008OpenAlexW1993769400MaRDI QIDQ1068049

József Dénes

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90022-6

zbMATH Keywords

parallel computationpermutation codingvoice coding

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Source coding (94A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über einige Eigenschaften der Kommutatoren der symmetrischen Halbgruppe
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• A critical analysis of the security of knapsack public-key algorithms
• Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
• Parallel permutation and sorting algorithms and a new generalized connection network
• On coding precedence relations with a pair-ordering fidelity criterion (Corresp.)
• Nonrandom binary superimposed codes
• A class of codes for asymmetric channels and a problem from the additive theory of numbers

This page was built for publication: On some connections between permutations and coding