scientific article
From MaRDI portal
Publication:3869197
zbMath0431.94001MaRDI QIDQ3869197
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Coding theorems (Shannon theory) (94A24) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items (36)
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines ⋮ An analysis of a class of algorithms for \(S\)-box construction ⋮ A GENERALIZATION OF HAUSDORFF DIMENSION APPLIED TO HILBERT CUBES AND WASSERSTEIN SPACES ⋮ Supervised pattern recognition by parallel feature partitioning ⋮ New insights on neutral binary representations for evolutionary optimization ⋮ Metric inference for social networks ⋮ A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms ⋮ Nonlinear data observability and information ⋮ On the errors that learning machines will make ⋮ On compressing and indexing repetitive sequences ⋮ Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto ⋮ Quantum information as a measure of multipartite correlation ⋮ Publishing anonymous survey rating data ⋮ Recoverable formal language ⋮ Theory construction in psychology: The interpretation and integration of psychological data ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ Minimum message length encoding and the comparison of macromolecules ⋮ Dynamic design of a reliable computer network on using information theory ⋮ A FIRST-ORDER OPTIMAL ALGORITHM FOR STATE IDENTIFICATION IN SEQUENTIAL LOGIC USING THE CONCEPT OF ENTROPY ⋮ Minimization of rounding errors algebraically by use of coding theory ⋮ Fast robust optimization using bias correction applied to the mean model ⋮ THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS ⋮ Parallel lossless image compression using Huffman and arithmetic coding ⋮ Minimal path length of trees with known fringe ⋮ New property of a generalized Hölder's inequality and its applications ⋮ A note on the construction of error detecting/correcting prefix codes ⋮ THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY ⋮ Coherent infomax as a computational goal for neural systems ⋮ A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\) ⋮ Parity codes ⋮ Hierarchical resolution of power spectra ⋮ Optimal weighted nearest neighbour classifiers ⋮ An information theoretic model of a reliable computer network ⋮ Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs ⋮ A random-walk pseudorandom byte generator ⋮ An efficient algorithm for solving the partial sum query problem
This page was built for publication:
