Using simulated annealing to design good codes

No abstract is available for this paper.

• Publication year

  1987

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1987-01-02

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.1987.1057277
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Lexicographic codes: Error-correcting codes from game theory

  1986cited by this paper
• Simulated Annealing Without Rejected Moves

  1986cited by this paper
• Error Control Coding: Fundamentals and Applications

  1985cited by this paper
• How Easy is Local Search?

  1985cited by this paper
• Applications of the annealing algorithm to combinatorial problems in statistics

  1985cited by this paper
• Optimization by Simulated Annealing

  1983cited by this paper
• Global Wiring by Simulated Annealing

  1983cited by this paper
• Upper bounds on the minimum distance of trellis codes

  1983cited by this paper
• Improved packing of equal circles on a sphere and rigidity of its graph

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Least squares quantization in PCM

  1982cited by this paper
• Tables of sphere packings and spherical codes

  1981cited by this paper
• Computerized tomography and nuclear magnetic resonance.

  1980cited by this paper
• Lower bounds for constant weight codes

  1980cited by this paper
• Asymptotically optimal block quantization

  1979cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• The Leech Lattice as a Code for the Gaussian Channel

  1971cited by this paper
• Information Theory and Reliable Communication

  1969cited by this paper
• Capabilities of bounded discrepancy decoding

  1965cited by this paper
• The problem of packing a number of equal nonoverlapping circles on a sphere

  1962cited by this paper
• Probability of error for optimal codes in a Gaussian channel

  1959cited by this paper
• The Closest Packing of Spherical Caps in n Dimensions

  1955cited by this paper
• Theory of Error-correcting Codes

  year unknowncited by this paper

• Energy-Aware Metaheuristics

  2026cites this paper
• Channel-Optimized Strategic Quantization

  2025cites this paper
• Sampling-Based Estimates of the Weight Enumerators of Reed-Muller Codes

  2025cites this paper
• Estimating the Weight Enumerators of Reed-Muller Codes via Sampling

  2024cites this paper
• Optimization and Identification of Lattice Quantizers

  2024cites this paper
• Diffusing Gaussian Mixtures for Generating Categorical Data

  2023cites this paper
• Using Reed-Muller Codes for Classification with Rejection and Recovery

  2023cites this paper
• Learning Label Encodings for Deep Regression

  2023cites this paper
• Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes

  2023cites this paper
• Strategic Quantization Over a Noisy Channel

  2023cites this paper
• Fully Adaptive Constant Module Sequence Set Design for Waveform-Agile Coherent Radar System in the Presence of Signal-Dependent Clutter

  2022cites this paper
• Degeneration vs Classical of simulated annealing algorithm: performance analysis

  2022cites this paper
• Optimal Codeword Construction for DNA-based Finite Automata

  2022cites this paper
• Evolutionary Strategies for the Design of Binary Linear Codes

  2022cites this paper
• Simulated Annealing-Based Image Reconstruction for Patients With COVID-19 as a Model for Ultralow-Dose Computed Tomography

  2022cites this paper
• A Survey of Quantization Methods for Efficient Neural Network Inference

  2021cites this paper
• A hybrid algorithm for the search of long binary sequences with low aperiodic autocorrelations

  2021cites this paper
• Concatenated Codes for Multiple Reads of a DNA Sequence

  2021cites this paper
• Diagrammatic Design and Study of Ansätze for Quantum Machine Learning

  2020cites this paper
• Constructive Spherical Codes by Hopf Foliations

  2020cites this paper
• A shape-gain approach for vector quantization based on flat tori

  2020cites this paper
• A mixed construction of variable-weight optical orthogonal code for optical code division multiple access networks

  2020cites this paper
• Enhanced Deployment Strategy for the 5G Drone-BS Using Artificial Intelligence

  2019cites this paper
• Concentration Estimates for Band-Limited Spherical Harmonics Expansions via the Large Sieve Principle

  2019cites this paper
• Error-Correcting Neural Network

  2019cites this paper
• Error-Correcting Output Codes with Ensemble Diversity for Robust Learning in Neural Networks

  2019cites this paper
• Constructive spherical codes in 2k dimensions

  2019cites this paper
• Mixed construction of OOC for optical code division multiple access networks

  2019cites this paper
• Beam Pattern Design Method Based on Particle Swarm Optimization

  2018cites this paper
• The Semantic Communication Game

  2018cites this paper
• Simulated Annealing Decoder for Linear Block Codes

  2018cites this paper
• Connections Between the Error Probability and the r-wise Hamming Distances

  2018cites this paper
• The r-wise hamming distance and its operational interpretation for block codes

  2018cites this paper
• Spherical Codes from Lattices

  2018cites this paper
• An Improved Iterated Hybrid Search for DNA Codes Design

  2018influential citation
• Lattices and Spherical Codes

  2017cites this paper
• Weak Flip Codes and their Optimality on the Binary Erasure Channel

  2017cites this paper
• The Pyramid Fuzzy C-means Algorithm

  2017cites this paper
• DNA Code Design Based on the Bloch Quantum Chaos Algorithm

  2017cites this paper
• Simulated Annealing Decoding of Linear Block Codes

  2016cites this paper
• Algoritmos de Optimización sobre Unidades de Proceso Gráfico

  2015cites this paper
• COVERING RADIUS 1985-1994 Dedicated to

  2015cites this paper
• Combinatorial Algorithms for Packings, Coverings and Tilings of Hypercubes

  2015cites this paper
• Combinatorial optimization algorithms for the design of codes: a survey

  2015cites this paper
• Linear unequal error protection codes based on terminated convolutional codes

  2015cites this paper
• Degeneration simulated annealing algorithm for combinatorial optimization problems

  2015cites this paper
• Improved Code Construction for Synchronization Error Correction

  2014cites this paper
• Dynamic Incremental K-means Clustering

  2014cites this paper
• Semantic index assignment

  2014cites this paper
• Dynamic Incremental Fuzzy C-Means Clustering

  2014cites this paper
• Flat tori, lattices and spherical codes

  2013cites this paper
• Computational Sequence Design Techniques for DNA Microarray Technologies

  2013cites this paper
• Optimum Allocation of Inspection Stations in Multistage Manufacturing Processes by Using Max-Min Ant System

  2013cites this paper
• On the relationship between clustering and coding theory

  2012cites this paper
• Sequence design for MPG QS-CDMA systems based on heuristic combinatorial optimization

  2012influential citation
• Constructive Spherical Codes on Layers of Flat Tori

  2012influential citation
• Codebook and marker sequence design for synchronization-correcting codes

  2011cites this paper
• Computational methods in codes and games

  2011cites this paper
• Accelerating floating-point fitness functions in evolutionary algorithms: a FPGA-CPU-GPU performance comparison

  2011cites this paper
• Coding Schemes for Relay Networks

  2011cites this paper
• Designing sparse frequency waveform with low range sidelobes for HFSWR

  2011cites this paper
• Codebook optimization using genetic algorithm and simulated annealing

  2011cites this paper
• Robust vector quantization for noisy channels using soft decision and sequential decoding

  2010cites this paper
• Low delay audio coding based on logarithmic spherical vector quantization

  2010cites this paper
• Index Assignment Optimization for Joint Source-Channel MAP Decoding

  2010cites this paper
• Network Code Design for Orthogonal Two-Hop Network with Broadcasting Relay: A Joint Source-Channel-Network Coding Approach

  2010cites this paper
• Spherical Logarithmic Quantization

  2010cites this paper
• Hybrid simulated annealing image reconstruction for transmission tomography

  2009cites this paper
• Heuristic Algorithms for Constructing Binary Constant Weight Codes

  2009cites this paper
• Control over Low-Rate Noisy Channels

  2009cites this paper
• Network code design for orthogonal multi-user channel with broadcasting relay: A joint source channel network coding approach

  2009cites this paper
• Spherical codes on torus layers

  2009influential citation
• Performance Analysis of Reconfigurable Clusters to Design Good Error Correcting Codes in Communications

  2009cites this paper
• Improved search strategies and extensions to k-medoids-based clustering algorithms

  2008cites this paper
• Channel Optimized Quantization of Images over Binary Channels with Memory J. Cheng and F. Alajaji April 1999 Channel Optimized Quantization of Images over Binary Channels with Memory

  2008cites this paper
• Channel Optimized Vector Quantization: Iterative Design Algorithms

  2008cites this paper
• Iterated local search and constructive heuristics for error correcting code design

  2007cites this paper
• An Improved Tabu Search for Vector Quantization

  2007cites this paper
• Heuristic construction of constant weight binary codes

  2007cites this paper
• Optimal Interleaver Design for Short Block-length Turbo Codes

  2007influential citation
• Tuning Extended Kalman Filter for Induction Motor drives using simulated annealing

  2007cites this paper
• Multiresolution training of Kohonen neural networks

  2007cites this paper
• An evolution-based tabu search approach to codebook design

  2007cites this paper
• The validity of pyramid K-means clustering

  2007cites this paper
• : Networks/graphs, heuristics: algorithms for graph partitioning. Simulation, applications: optimization by simulated annealing.

  2007cites this paper
• defined via the subword closure operation

  2007cites this paper
• Comparative Study on Optimising the EKF for Speed Estimation of an Induction Motor using Simulated Annealing and Genetic Algorithm

  2007cites this paper
• Encoding methods for DNA languages defined via the subword closure operation

  2007cites this paper
• WARPED LINEAR PREDICTION FOR IMPROVED PERCEPTUAL QUALITY IN THE SCELP LOW DELAY AUDIO CODEC (W-SCELP)

  2007cites this paper
• Algorithm Selection : A Quantitative Optimization-Intensive Approach 1

  2007cites this paper
• A genetic algorithm to design error correcting codes

  2006cites this paper
• Error-resilient first-order multiplexed source codes: performance bounds, design and decoding algorithms

  2006cites this paper
• An Efficient Codebook for the SCELP Low Delay Audio Codec

  2006cites this paper
• New self-organizing algorithms for topological maps

  2006cites this paper
• A genetic algorithm to design error correcting codes

  2006cites this paper
• Improving performance and robustness of domain-specific CPLDs

  2006cites this paper
• Index assignment optimization for joint source-channel MAP decoding

  2006cites this paper
• Source{Channel Coding for Closed-Loop Control

  2006cites this paper
• Scelp: Lowdelay audio coding with noise shaping based on spherical vector quantization

  2006cites this paper
• Effective heuristic methods of dna strand design

  2006cites this paper