Coding, filtering, and information theory
Message coding, signal filtering, and information theory for space communications
SPACE COMMUNICATION↗
SEARCH · Search NASA
Results for “Coding and Information Theory”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Information processing - A class of two- weight codes
General theory to prove existence of class of two weight codes
BINARY CODE↗
A strong converse to the coding theorem for continuous memoryless channels
Computer programming - strong converse to coding theorem for continuous memoryless channels
INFORMATION THEORY↗
Principles of communication engineering.
Textbook on communication engineering emphasizing random processes, information and detection theory, statistical communication theory, applications, etc
COMMUNICATION THEORY↗
Data compression
An approach to data compression is discussed in which the effect achieved by compression is evaluated by the closeness of the approach to the minimum possible volume. An attempt is made to systematize the known results on data compression. The review contains: description of methods of data compression based on statistical coding and information theory; application of methods of interpolation and extrapolation; a specific compression method (related to description of the histogram of a sample); some criteria of effectiveness and methods of service information representation; and discussion of models suggested for theoretical analysis.
Babkin, V. F.↗
MCNP ® Code V.6.3.0 Release Notes
The Monte Carlo N-Particle ® (MCNP ® ) code is a general-purpose, continuous-energy, generalized geometry, time-dependent, radiation transport code developed by the MCNP development team. The MCNP calculations provide predictive capabilities that can replace expensive or impossible-to perform experiments. Specific application problems include simulations of experimental diagnostics, intrinsic radiation, radiation detection and measurement, criticality safety, nuclear threat reduction and response, radiation health protection, nuclear weapons effects, and nuclear forensics. This MCNP code, version 6.3.0, follows the MCNP6.2.0 version. Since the release of MCNP6.2.0, many changes have been made to the MCNP code. These changes include new or improved features, a new build system, code enhancement and modernization, and bug fixes. The MCNP code, version 6.3.0, theory and user input information is documented in MCNP ® Code Version 6.3.0 Theory & User Manual, the build guidance for various platforms is documented in MCNP ® Code Version 6.3.0 Build Guide, and the verification and validation testing for various application benchmark test suites is documented in MCNP ® Code Version 6.3.0 Verification & Validation Testing.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
MCNP® Code Version 6.3.1 Release Notes
The Monte Carlo N-Particle® (MCNP® ) code is a general-purpose, continuous-energy, generalized-geometry, time-dependent, radiation transport code developed by the MCNP development team. MCNP calculations provide predictive capabilities that can replace expensive or impossible-to-perform experiments. Specific application problems include simulations of experimental diagnostics, intrinsic radiation, radiation detection and measurement, criticality safety, nuclear threat reduction and response, radiation health protection, nuclear weapons effects, and nuclear forensics. This MCNP code, version 6.3.1, follows the MCNP6.3.0 version. Since the release of MCNP6.3.0, a variety of bug fixes and code enhancements have been completed for MCNP6.3.1. A few new features have also been added to this release to support both ongoing research and the release of the latest ENDF/B-VIII.1 nuclear data library. The MCNP code, version 6.3.1, theory and user input information is documented in MCNP® Code Version 6.3.1 Theory & User Manual, the build guidance for various platforms is documented in MCNP® Code Version 6.3.1 Build Guide, and the verification and validation testing for various application benchmark test suites is documented in MCNP® Code Version 6.3.1 Verification & Validation Testing.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
The random coding bound is tight for the average code.
The random coding bound of information theory provides a well-known upper bound to the probability of decoding error for the best code of a given rate and block length. The bound is constructed by upperbounding the average error probability over an ensemble of codes. The bound is known to give the correct exponential dependence of error probability on block length for transmission rates above the critical rate, but it gives an incorrect exponential dependence at rates below a second lower critical rate. Here we derive an asymptotic expression for the average error probability over the ensemble of codes used in the random coding bound. The result shows that the weakness of the random coding bound at rates below the second critical rate is due not to upperbounding the ensemble average, but rather to the fact that the best codes are much better than the average at low rates.
Gallager, R. G.↗
Antennas
Reception of the exceedingly small signals from spacecraft typical of deep space communication requires antennas of enormous size, complexity, and precision. The two Voyager spacecraft each have 20-watt X-band transmitters; and at their Saturn encounter distances from Earth of approximately 1.5 billion kilometers, the power density received on the Earth was less than 10 to the minus 19th power watts per square meters. The thrust in deep-space communications improvement was in the areas of ground and spacecraft antenna size and performance increases, spacecraft transmitter power increase, ground receiving system design, and telemetry information coding. Ground antenna theory, design, and performance as related to the particular problem of receiving spacecraft signals using the Deep Space Network (DSN) is described.
Slobin, S. D.↗
Processing and transmission of information
Coding theorems and shift register synthesis in relation to processing and transmission of information
COMMUNICATION THEORY↗
Thermodynamics of signal transduction systems and fluctuation theorem in a signal cascade
Biochemical chain reactions are signal transduction cascades that can transmit biological information about the intracellular environment. In this study, we modelled a chain reaction as a code string for applying information theory. Herein, we assumed that cell signal transduction selects a strategy to maximize the transduced signal per signal event duration. To investigate the same, we calculated the information transmission capacity of the reaction chain by maximizing the average entropy production rate per reaction time, indicating the idea of the entropy coding method. Moreover, we defined a signal cascade trajectory. Subsequently, we found that the logarithm of the forward and reverse transition ratio per reaction time is equal to the entropy production rate, which derives the form of the fluctuation theorem in signal transduction. Our findings suggest the application of information entropy theory for analysing signal transduction.
59 BASIC BIOLOGICAL SCIENCES↗
High compression image and image sequence coding
The digital representation of an image requires a very large number of bits. This number is even larger for an image sequence. The goal of image coding is to reduce this number, as much as possible, and reconstruct a faithful duplicate of the original picture or image sequence. Early efforts in image coding, solely guided by information theory, led to a plethora of methods. The compression ratio reached a plateau around 10:1 a couple of years ago. Recent progress in the study of the brain mechanism of vision and scene analysis has opened new vistas in picture coding. Directional sensitivity of the neurones in the visual pathway combined with the separate processing of contours and textures has led to a new class of coding methods capable of achieving compression ratios as high as 100:1 for images and around 300:1 for image sequences. Recent progress on some of the main avenues of object-based methods is presented. These second generation techniques make use of contour-texture modeling, new results in neurophysiology and psychophysics and scene analysis.
Kunt, Murat↗
Space-time generalization of mutual information
The mutual information characterizes correlations between spatially separated regions of a system. Yet, in experiments we often measure dynamical correlations, which involve probing operators that are also separated in time. Here, we introduce a space-time generalization of mutual information which, by construction, satisfies several natural properties of the mutual information and at the same time characterizes correlations across subsystems that are separated in time. In particular, this quantity, that we call the space-time mutual information, bounds all dynamical correlations. We construct this quantity based on the idea of the quantum hypothesis testing. As a by-product, our definition provides a transparent interpretation in terms of an experimentally accessible setup. We draw connections with other notions in quantum information theory, such as quantum channel discrimination. Finally, we study the behavior of the space-time mutual information in several settings and contrast its long-time behavior in many-body localizing and thermalizing systems.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
The black hole interior from non-isometric codes and complexity
Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of “non-isometric codes protected by computational complexity”. We show that many previous ideas, such as the existence of a large number of “null states”, a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, “state-dependent/state-specific” operator reconstruction, and the “simple entropy” approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
A modified cosmic brane proposal for holographic Renyi entropy
We propose a new formula for computing holographic Renyi entropies in the presence of multiple extremal surfaces. Our proposal is based on computing the wave function in the basis of fixed-area states and assuming a diagonal approximation for the Renyi entropy. For Renyi index n ≥ 1, our proposal agrees with the existing cosmic brane proposal for holographic Renyi entropy. For n < 1, however, our proposal predicts a new phase with leading order (in Newton’s constant G) corrections to the cosmic brane proposal, even far from entanglement phase transitions and when bulk quantum corrections are unimportant. Recast in terms of optimization over fixed-area states, the difference between the two proposals can be understood to come from the order of optimization: for n < 1, the cosmic brane proposal is a minimax prescription whereas our proposal is a maximin prescription. We demonstrate the presence of such leading order corrections using illustrative examples. In particular, our proposal reproduces existing results in the literature for the PSSY model and high-energy eigenstates, providing a universal explanation for previously found leading order corrections to the n < 1 Renyi entropies.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Information processing - Tri-weight cyclic codes
Theorem to characterize class of cyclic codes with three non-zero weights
CODING SYSTEM↗
Approximate Entropy and Sample Entropy: A Comprehensive Tutorial
Approximate Entropy and Sample Entropy are two algorithms for determining the regularity of series of data based on the existence of patterns. Despite their similarities, the theoretical ideas behind those techniques are different but usually ignored. This paper aims to be a complete guideline of the theory and application of the algorithms, intended to explain their characteristics in detail to researchers from different fields. While initially developed for physiological applications, both algorithms have been used in other fields such as medicine, telecommunications, economics or Earth sciences. In this paper, we explain the theoretical aspects involving Information Theory and Chaos Theory, provide simple source codes for their computation, and illustrate the techniques with a step by step example of how to use the algorithms properly. This paper is not intended to be an exhaustive review of all previous applications of the algorithms but rather a comprehensive tutorial where no previous knowledge isrequired to understand the methodology.
Delgado-Bonal, Alfonso↗
Advanced technology development for image gathering, coding, and processing
Three overlapping areas of research activities are presented: (1) Information theory and optimal filtering are extended to visual information acquisition and processing. The goal is to provide a comprehensive methodology for quantitatively assessing the end-to-end performance of image gathering, coding, and processing. (2) Focal-plane processing techniques and technology are developed to combine effectively image gathering with coding. The emphasis is on low-level vision processing akin to the retinal processing in human vision. (3) A breadboard adaptive image-coding system is being assembled. This system will be used to develop and evaluate a number of advanced image-coding technologies and techniques as well as research the concept of adaptive image coding.
Huck, Friedrich O.↗