research-article

Using simulated annealing to design good codes

Authors:

Abbas A. El Gamal,

Lane A. Hemachandra,

Itzhak Shperling,

Victor K. WeiAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 33, Issue 1

Pages 116 - 123

https://doi.org/10.1109/TIT.1987.1057277

Published: 02 January 1987 Publication History

Abstract

Simulated annealing is a computational heuristic for obtaining approximate solutions to combinatorial optimization problems. It is used to construct good source codes, error-correcting codes, and spherical codes. For certain sets of parameters codes that are better than any other known in the literature are found.

Cited By

View all

Regol FCoates MWilliams BChen YNeville J(2023)Diffusing Gaussian mixtures for generating categorical dataProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i8.26145(9570-9578)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i8.26145
Fentham DParker DRyan M(2023)Using Reed-Muller Codes for Classification with Rejection and RecoveryFoundations and Practice of Security10.1007/978-3-031-57537-2_3(36-52)Online publication date: 11-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-57537-2_3
Carlet CMariot LManzoni LPicek S(2023)Evolutionary Strategies for the Design of Binary Linear CodesEvolutionary Computation in Combinatorial Optimization10.1007/978-3-031-30035-6_8(114-129)Online publication date: 12-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-30035-6_8
Show More Cited By

Index Terms

Using simulated annealing to design good codes

Recommendations

Solving the team orienteering problem using effective multi-start simulated annealing

The team orienteering problem (TOP) is known as an NP-complete problem. A set of locations is provided and a score is collected from the visit to each location. The objective is to maximize the total score given a fixed time limit for each available ...
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

The quadratic assignment problem (QAP) is one of the well-known combinatorial optimization problems and is known for its various applications. In this paper, we propose a modified simulated annealing algorithm for the QAP - M-SA-QAP. The novelty of the ...
A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

The fixed-cost Capacitated Multicommodity Network Design (CMND) problem is a well known NP-hard problem. This paper presents a matheuristic algorithm combining Simulated Annealing (SA) metaheuristic and Simplex method for CMND problem. In the proposed ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 33, Issue 1

January 2, 1987

179 pages

ISSN:0018-9448

Editor:
A. D. Wyner

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 02 January 1987

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Regol FCoates MWilliams BChen YNeville J(2023)Diffusing Gaussian mixtures for generating categorical dataProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i8.26145(9570-9578)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i8.26145
Fentham DParker DRyan M(2023)Using Reed-Muller Codes for Classification with Rejection and RecoveryFoundations and Practice of Security10.1007/978-3-031-57537-2_3(36-52)Online publication date: 11-Dec-2023
https://dl.acm.org/doi/10.1007/978-3-031-57537-2_3
Carlet CMariot LManzoni LPicek S(2023)Evolutionary Strategies for the Design of Binary Linear CodesEvolutionary Computation in Combinatorial Optimization10.1007/978-3-031-30035-6_8(114-129)Online publication date: 12-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-30035-6_8
Zhang MZhou ZYang MLiu ZYang Y(2021)A hybrid algorithm for the search of long binary sequences with low aperiodic autocorrelationsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-021-06084-725:20(12725-12744)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s00500-021-06084-7
Lin HMoser SChen P(2018)Connections Between the Error Probability and the r-wise Hamming Distances2018 International Symposium on Information Theory and Its Applications (ISITA)10.23919/ISITA.2018.8664296(130-134)Online publication date: 28-Oct-2018
https://dl.acm.org/doi/10.23919/ISITA.2018.8664296
Kuramoto ACiriaco FAbrão TJeszensky P(2012)Sequence design for MPG QS-CDMA systems based on heuristic combinatorial optimizationWireless Communications & Mobile Computing10.1002/wcm.95312:3(236-247)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1002/wcm.953
Gomez-Pulido JVega-Rodriguez MSanchez-Perez JPriem-Mendes SCarreira V(2011)Accelerating floating-point fitness functions in evolutionary algorithmsGenetic Programming and Evolvable Machines10.1007/s10710-011-9137-212:4(403-427)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1007/s10710-011-9137-2
Montemanni RSmith D(2009)Heuristic algorithms for constructing binary constant weight codesIEEE Transactions on Information Theory10.1109/TIT.2009.202749155:10(4651-4656)Online publication date: 1-Oct-2009
https://dl.acm.org/doi/10.1109/TIT.2009.2027491
Chu SRoddick JPan J(2008)Improved search strategies and extensions to k-medoids-based clustering algorithmsInternational Journal of Business Intelligence and Data Mining10.1504/IJBIDM.2008.0205203:2(212-231)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.1504/IJBIDM.2008.020520
Buyamin SFinch J(2007)Tuning Extended Kalman Filter for Induction Motor drives using simulated annealingProceedings of the 26th IASTED International Conference on Modelling, Identification, and Control10.5555/1710594.1710679(446-451)Online publication date: 31-Jan-2007
https://dl.acm.org/doi/10.5555/1710594.1710679
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Solving the team orienteering problem using effective multi-start simulated annealing

A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

A Hybrid Simulated Annealing and Simplex Method for Fixed-Cost Capacitated Multicommodity Network Design

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations