Least squares quantization in PCM
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
It has long been realized that in pulse-code modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary as the one-third power of the probability density per unit voltage of signal amplitudes. In this paper the corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy. The optimization criterion used is that the average quantization noise power be a minimum. It is shown that the result obtained here goes over into the Panter and Dite result as the number of quanta become large. The optimum quautization schemes for2^{b}quanta,b=1,2, \cdots, 7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
Oliver, B. M., Pierce, J. R., & Shannon, C. E. (1948) · Proceedings of the IRE · doi:10.1109/jrproc.1948.231941 · Cited by 273
A Generalized Sampling Theorem
Kramer, H. P. (1959) · Studies in Applied Mathematics · doi:10.1002/sapm195938168 · Cited by 249
Quantization Distortion in Pulse-Count Modulation with Nonuniform Spacing of Levels
Panter, P. F., & Dite, W. (1951) · Proceedings of the IRE · doi:10.1109/jrproc.1951.230419 · Cited by 225
On a Generalized Sampling Theorem
Takizawa, É. I. (1975) · Journal of the Japan Society of Precision Engineering · doi:10.2493/jjspe1933.41.1050 · Cited by 208
Instantaneous companding of quantized signals
Smith, B. (1957) · The Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb03858.x · Cited by 198
Kač, M. (1934) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-9.2.116 · Cited by 183
A SIMPLE PROOF AND SOME EXTENSIONS OF THE SAMPLING THEOREM
Parzen, E. (1956) · Defense Technical Information Center (DTIC) · doi:10.21236/ad0117999 · Cited by 48
The Comparison of Measured and Calculated Solar Radiations in Trabzon, Turkey
Kaygusuz, K. (1999) · Energy Sources · doi:10.1080/00908319950014830 · Cited by 47
Research works printed but not linked: 7
- 1956, Math Rev, 17, 757
- sch�tzenberger, 1954, Pub de l'Inst de Statis, 3, 56
- fleischer, 1964, Sufficient conditions for achieving minimum distortion in quantizer, IEEE Int Convention Record, 12, 104
- doob, 1953, Stochastic Processes
- lloyd, 1956, Linear least squares filtering and prediction of sampled signals, Symp Modern Network Synthesis, 5, 221
- zygmund, 1955, Trigonometrical Series, 47
- black, 1953, Modulation Theory
Cited by
Items 601–700 of 1,045
Trajectory Clustering: A Partition-and-Group Framework
Lee, J.-G., Han, J., & Whang, K.-Y. (2007) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 155
The Lion's Algorithm: A New Nature-Inspired Search Algorithm
Rajakumar, B. R. (2012) · Procedia Technology · doi:10.1016/j.protcy.2012.10.016 · Cited by 154
On the FaaS Track: Building Stateful Distributed Applications with Serverless Architectures
Barcelona-Pons, D., Sánchez‐Artigas, M., París, G., Sutra, P., & García-López, P. (2019) · International Middleware Conference · doi:10.1145/3361525.3361535 · Cited by 154
Inhaled SARS-CoV-2 vaccine for single-dose dry powder aerosol immunization
Ye, T., Jiao, Z., Li, X., He, Z., Li, Y., Yang, F., Zhao, X., Wang, Y., Huang, W., Qin, M., et al. (2023) · Nature · doi:10.1038/s41586-023-06809-8 · Cited by 156
Clustering for metric and nonmetric distance measures
Ackermann, M. R., Blömer, J., & Sohler, C. (2010) · ACM Transactions on Algorithms · doi:10.1145/1824777.1824779 · Cited by 155
Recent Advances in Graph PartitioningPreprint
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.3144 · Cited by 154
Variational mesh segmentation via quadric surface fitting
Dong-ming Yan, A., Wang, W., Liu, Y., & Yang, Z. (2012) · Computer-Aided Design · doi:10.1016/j.cad.2012.04.005 · Cited by 153
The development of grain structure during additive manufacturing
Chadwick, A. F., & Voorhees, P. W. (2021) · Acta Materialia · doi:10.1016/j.actamat.2021.116862 · Cited by 153
Hwang, S., & Sugiyama, J. (2021) · Plant Methods · doi:10.1186/s13007-021-00746-1 · Cited by 156
An evaluation of descriptors for large-scale image retrieval from sketched feature lines
Eitz, M., Hildebrand, K., Boubekeur, T., & Alexa, M. (2010) · Computers & Graphics · doi:10.1016/j.cag.2010.07.002 · Cited by 152
K-Means Cluster Analysis for Image Segmentation
M.AqilBurney, S., & Tariq, H. (2014) · International Journal of Computer Applications · doi:10.5120/16779-6360 · Cited by 152
Cantat-Gaudin, T., Krone-Martins, A., Sedaghat, N., Farahi, A., de Souza, R. S., Skalidis, R., Malz, A. I., Macêdo, S., Moews, B., Jordi, C., et al. (2019) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201834453 · Cited by 152
Comanducci, G., Magalhães, F., Ubertini, F., & Cunha, Á. A. M. F. (2016) · Structural Health Monitoring · doi:10.1177/1475921716650630 · Cited by 151
Zhu, D., Choi, J. J., & Heath, R. W. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2702617 · Cited by 151
Scaling Up Graph Neural Networks Via Graph Coarsening
Huang, Z., Zhang, S., Xi, C., Liu, T., & Zhou, M. Q. (2021) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3447548.3467256 · Cited by 151
Combining image compression and classification using vector quantization
Oehler, K. L., & Gray, R. M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391396 · Cited by 150
Rosette Tracker: An Open Source Image Analysis Tool for Automatic Quantification of Genotype Effects
Vylder, J. D., Vandenbussche, F., Hu, Y., Philips, W. R., & Straeten, D. V. D. (2012) · PLANT PHYSIOLOGY · doi:10.1104/pp.112.202762 · Cited by 150
Tatu, A., Albuquerque, G., Eisemann, M., Schneidewind, J., Theisel, H., Magnor, M. A., & Keim, D. A. (2009) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2009.5332628 · Cited by 150
Advances in Studies and Applications of Centroidal Voronoi Tessellations
Du, Q., Gunzburger, M., & Ju, L. (2010) · Numerical Mathematics Theory Methods and Applications · doi:10.4208/nmtma.2010.32s.1 · Cited by 150
Credal c-means clustering method based on belief functions
Liu, Z., Pan, Q., Dezert, J., & Mercier, G. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.11.013 · Cited by 150
Adaptive Clustering for Dynamic IoT Data Streams
Puschmann, D., Barnaghi, P. M., & Tafazolli, R. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2618909 · Cited by 150
More Recent Advances in (Hyper)Graph Partitioning
Çatalyürek, Ü. V., Devine, K., Faraj, M. F., Gottesbüren, L., Heuer, T., Meyerhenke, H., Sanders, P., Schlag, S., Schulz, C., Seemaier, D., et al. (2023) · ACM Computing Surveys · doi:10.1145/3571808 · Cited by 150
Thermal catalytic reforming for hydrogen production with zero CO 2 emission
Peng, M., Ge, Y., Gao, R., Yang, J., Li, A., Xie, Z., Yu, Q., Zhang, J., Asakura, H., Zhang, H., et al. (2025) · Science · doi:10.1126/science.adt0682 · Cited by 150
Wide area localization on mobile phones
Arth, C., Wagner, D., Klopschitz, M., Irschara, A., & Schmalstieg, D. (2009) · 2009 8th IEEE International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2009.5336494 · Cited by 127
A Fast Adaptive k-means with No Bounds
Xia, S., Peng, D., Meng, D., Zhang, C., Wang, G., Giem, E., Wei, W., & Chen, Z. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3008694 · Cited by 149
Spectrally Shaped DP-16QAM Super-Channel Transmission with Multi-Channel Digital Back-Propagation
Maher, R., Xu, T., Galdino, L., Sato, M., Alvarado, A., Shi, K., Savory, S. J., Thomsen, B. C., Killey, R. I., & Bayvel, P. (2015) · Scientific Reports · doi:10.1038/srep08214 · Cited by 149
The analysis of a simple k -means clustering algorithm
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C., Silverman, R., & Wu, A. Y. (2000) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/336154.336189 · Cited by 149
Tradeoff between source and channel coding
Hochwald, B. M., & Zeger, K. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623141 · Cited by 149
Rodríguez-Barroso, N., Stipcich, G., Jiménez-López, D., Ruiz-Millán, J. A., Martínez-Cámara, E., González-Seco, G., Luzón, M. V., Veganzones, M. A., & Herrera, F. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.07.009 · Cited by 148
A framework for efficient spatial web object retrieval
Wu, D., Cong, G., & Jensen, C. S. (2012) · The VLDB Journal · doi:10.1007/s00778-012-0271-0 · Cited by 148
Random Projection Trees for Vector Quantization
Dasgupta, S., & Freund, Y. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021326 · Cited by 148
Learning in high-dimensional multimedia data: the state of the art
Gao, L., Song, J., Liu, X., Shao, J., Liu, J., & Shao, J. (2015) · Multimedia Systems · doi:10.1007/s00530-015-0494-1 · Cited by 149
Automated Method to Determine Two Critical Growth Stages of Wheat: Heading and Flowering
Sadeghi‐Tehran, P., Sabermanesh, K., Virlet, N., & Hawkesford, M. J. (2017) · Frontiers in Plant Science · doi:10.3389/fpls.2017.00252 · Cited by 151
Cooperative coverage path planning for visual inspection
Mansouri, S. S., Kanellakis, C., Fresk, E., Kominiak, D., & Nikolakopoulos, G. (2018) · Control Engineering Practice · doi:10.1016/j.conengprac.2018.03.002 · Cited by 148
N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding
McConville, R., Santos‐Rodríguez, R., Piechocki, R. J., & Craddock, I. J. (2021) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr48806.2021.9413131 · Cited by 150
Machine Learning in Arrhythmia and Electrophysiology
Trayanova, N. A., Popescu, D. M., & Shade, J. K. (2021) · Circulation Research · doi:10.1161/circresaha.120.317872 · Cited by 148
Székely, Á., Lipari, F., Antonioni, A., Paolucci, M., Sánchez, Á., Tummolini, L., & Andrighetto, G. (2021) · Nature Communications · doi:10.1038/s41467-021-25734-w · Cited by 149
Zheng, Y., Tang, S., Teng, G., Ge, Y., Liu, K., Qin, J., Qi, D., & Chen, D. (2021) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00826 · Cited by 148
Optimised deployment of a European CO2 transport network
Morbée, J., Serpa, J., & Tzimas, E. (2012) · International journal of greenhouse gas control · doi:10.1016/j.ijggc.2011.11.011 · Cited by 147
Practical Human Sensing in the Light
Li, T., Liu, Q., & Zhou, X. (2016) · International Conference on Mobile Systems, Applications, and Services · doi:10.1145/2906388.2906401 · Cited by 147
Constant approximation for k-median and k-means with outliers via iterative rounding
Krishnaswamy, R., Shi, L., & Sandeep, S. (2018) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3188745.3188882 · Cited by 147
Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering
Makarychev, K., Makarychev, Y., & Razenshteyn, I. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316350 · Cited by 147
Treves, H., Küken, A., Arrivault, S., Ishihara, H., Hoppe, I., Erban, A., Höhne, M., Moraes, T. A., Kopka, J., Szymański, J., et al. (2021) · Nature Plants · doi:10.1038/s41477-021-01042-5 · Cited by 149
Data-driven discovery of intrinsic dynamics
Floryan, D., & Graham, M. D. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00575-4 · Cited by 147
Web usage mining to improve the design of an e-commerce website: OrOliveSur.com
Carmona, C. J., Ramírez‐Gallego, S., Ruíz, F. J. T., Bernal, E., del Jesús, M. J., & García, S. (2012) · Expert Systems with Applications · doi:10.1016/j.eswa.2012.03.046 · Cited by 146
Ahmed, K. R., & Akter, S. (2017) · Remote Sensing Applications Society and Environment · doi:10.1016/j.rsase.2017.08.010 · Cited by 146
Recent developments and applications of simultaneous localization and mapping in agriculture
Ding, H., Zhang, B., Zhou, J. C., Yan, Y., Tian, G., & Gu, B. (2022) · Journal of Field Robotics · doi:10.1002/rob.22077 · Cited by 146
Székely, Ł. A., & Wang, H. (2004) · Advances in Applied Mathematics · doi:10.1016/j.aam.2004.07.002 · Cited by 146
How Many Clusters? An Information-Theoretic Perspective
Still, S., & Bialek, W. (2004) · Neural Computation · doi:10.1162/0899766042321751 · Cited by 146
Frandsen, P. B., Calcott, B., Mayer, C., & Lanfear, R. (2015) · BMC Evolutionary Biology · doi:10.1186/s12862-015-0283-7 · Cited by 145
k-Means Has Polynomial Smoothed Complexity
Arthur, D., Manthey, B., & Röglin, H. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.14 · Cited by 146
Putative cell type discovery from single-cell gene expression data
Miao, Z., Moreno, P. A., Huang, N., Papatheodorou, I., Brazma, A., & Teichmann, S. A. (2020) · Nature Methods · doi:10.26226/morressier.5ebd45acffea6f735881af34 · Cited by 145
Mathematical optimization in intensity modulated radiation therapy
Ehrgott, M., Güler, Ç., Hamacher, H. W., & Shao, L. (2009) · Annals of Operations Research · doi:10.1007/s10479-009-0659-4 · Cited by 145
Random Projections for $k$-means ClusteringPreprint
Boutsidis, C., Zouzias, A., & Petros Drineas, B. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.4632 · Cited by 145
Model Compression with Adversarial Robustness: A Unified Optimization Framework
Gui, S., Wang, H., Yu, C., Yang, H., Wang, Z., & Liu, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.03538 · Cited by 53
Learning relational affordance models for robots in multi-object manipulation tasks
Moldovan, B., Moreno, P., van Otterlo, M., Santos-Victor, J., & Raedt, L. D. (2012) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2012.6225042 · Cited by 144
Liking versus Complexity: Decomposing the Inverted U-curve
Güçlütürk, Y., Jacobs, R. H. A. H., & van Lier, R. (2016) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2016.00112 · Cited by 149
Simulating galactic dust grain evolution on a moving mesh
McKinnon, R., Vogelsberger, M., Torrey, P., Marinacci, F., & Kannan, R. (2018) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/sty1248 · Cited by 144
Towards the Limit of Network Quantization
Choi, Y., El-Khamy, M., & Lee, J. (2016) · arXiv · doi:10.48550/arxiv.1612.01543 · Cited by 143
Advances in nowcasting influenza-like illness rates using search query logs
Lampos, V., Miller, A. C., Crossan, S., & Stefansen, C. (2015) · Scientific Reports · doi:10.1038/srep12760 · Cited by 143
Image Transformation Based on Learning Dictionaries across Image Spaces
Jia, K., Wang, X., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.95 · Cited by 136
Computer Vision and Machine Learning for Autonomous Characterization of AM Powder Feedstocks
DeCost, B., Jain, H., Rollett, A. D., & Holm, E. A. (2016) · JOM · doi:10.1007/s11837-016-2226-1 · Cited by 144
Three-dimensional atomic packing in amorphous solids with liquid-like structure
Yuan, Y., Kim, D. S., Zhou, J., Chang, D. J., Zhu, F., Nagaoka, Y., Yang, Y., Phạm, M., Osher, S., Chen, O., et al. (2021) · Nature Materials · doi:10.1038/s41563-021-01114-z · Cited by 143
Gene-Expression Profiling Predicts Recurrence in Dukes’ C Colorectal Cancer
Arango, D., Laiho, P., Kokko, A., Alhopuro, P., Sammalkorpi, H., Salovaara, R., Nicorici, D., Hautaniemi, S., Alazzouzi, H., Mecklin, J., et al. (2005) · Gastroenterology · doi:10.1053/j.gastro.2005.06.066 · Cited by 143
Learning to cluster faces on an affinity graph
Yang, L., Zhan, X., Chen, D., Yan, J., Loy, C. C., & Lin, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00240 · Cited by 142
“With a given number of clusters k , K-means minimizes the total intra-cluster variance.”
MethodInfluentialSimultaneous Coverage and Tracking (SCAT) of Moving Targets with Robot Networks
Pimenta, L. C. A., Schwager, M., Lindsey, Q., Kumar, V., Rus, D. L., Mesquita, R. C., & Pereira, G. A. S. (2009) · Springer tracts in advanced robotics · doi:10.1007/978-3-642-00312-7_6 · Cited by 142
Regularized k-means clustering of high-dimensional data and its asymptotic consistency
Sun, W., Wang, J., & Fang, Y. (2012) · Electronic Journal of Statistics · doi:10.1214/12-ejs668 · Cited by 142
Planning for tourism routes using social networks
Cenamor, I., de la Rosa, T., Núñez, S., & Borrajo, D. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.10.030 · Cited by 141
Local search methods for k-means with outliers
Gupta, S., Kumar, R., Lu, K., Moseley, B., & Vassilvitskii, S. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3067421.3067425 · Cited by 142
Bacci, G., Lasaulce, S., Saad, W., & Sanguinetti, L. (2016) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2451994 · Cited by 129
Optimality of spectral clustering in the Gaussian mixture model
Löffler, M., Zhang, A. Y., & Zhou, H. H. (2021) · The Annals of Statistics · doi:10.1214/20-aos2044 · Cited by 142
Toward autonomous laboratories: Convergence of artificial intelligence and experimental automation
Xie, Y., Sattari, K., Zhang, C., & Lin, J. (2022) · Progress in Materials Science · doi:10.1016/j.pmatsci.2022.101043 · Cited by 143
Zhang, D., Yuan, Q., Meng, L., Xia, R., Liu, W., & Qin, C. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11439-9 · Cited by 144
Self-organised clustering for road extraction in classified imagery
Doucette, P. J., Agouris, P., Stefanidis, A., & Musavi, M. T. (2001) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/s0924-2716(01)00027-2 · Cited by 142
Remote Sensing Image Processing
Camps‐Valls, G., Tuia, D., Gómez‐Chova, L., Jiménez, S., & Malo, J. (2012) · Synthesis lectures on image, video, and multimedia processing · doi:10.1007/978-3-031-02247-0 · Cited by 142
Too Much Knowledge? Security Beliefs and Protective Behaviors Among United States Internet Users
Wash, R., & Rader, E. J. (2015) · Symposium On Usable Privacy and Security · Cited by 141
Clustering using sum-of-norms regularization: With application to particle filter output computation
Lindsten, F., Ohlsson, H., & Ljung, L. (2011) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2011.5967659 · Cited by 141
Vector approximation based indexing for non-uniform high dimensional data sets
Ferhatosmanoğlu, H., Tuncel, E., Agrawal, D., & Abbadi, A. E. (2000) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/354756.354820 · Cited by 141
Trushkin, A. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056480 · Cited by 141
Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering
Hämäläinen, J., Jauhiainen, S., & Kärkkäinen, T. (2017) · Algorithms · doi:10.3390/a10030105 · Cited by 140
K-Multiple-Means: A Multiple-Means Clustering Method with Specified K Clusters
Nie, F., Wang, C., & Li, X. (2019) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3292500.3330846 · Cited by 140
Continual Learning for Blind Image Quality Assessment
Zhang, W., Li, D., Ma, C., Zhai, G., Yang, X., & Ma, K. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3178874 · Cited by 140
Mixture of Cluster-Conditional LoRA Experts for Vision-Language Instruction Tuning
Gou, Y., Liu, Z., Chen, K., Hong, L., Xu, H., Li, Z., Yeung, D., Kwok, J. T.-Y., & Zhang, Y. (2026) · IEEE Transactions on Image Processing · doi:10.1109/tip.2026.3678087 · Cited by 142
Self-consistency: a fundamental concept in statistics
Flury, B. D., & Tarpey, T. (1996) · Statistical Science · doi:10.1214/ss/1032280215 · Cited by 140
On identification of FIR systems having quantized output data
Godoy, B. I., Goodwin, G. C., Agüero, J. C., Marelli, D., & Wigren, T. (2011) · Automatica · doi:10.1016/j.automatica.2011.06.008 · Cited by 140
Palumbo, M. C., Zenoni, S., Fasoli, M., Massonnet, M., Farina, L., Castiglione, F., Pezzotti, M., & Paci, P. (2014) · The Plant Cell · doi:10.1105/tpc.114.133710 · Cited by 139
Tools for the analysis of high-dimensional single-cell RNA sequencing data
Wu, Y., & Zhang, K. (2020) · Nature Reviews Nephrology · doi:10.1038/s41581-020-0262-0 · Cited by 139
World Seaborne Trade in Real Time: A Proof of Concept for Building AIS-based Nowcasts from Scratch
Cerdeiro, D. A., Komáromi, A., Liu, Y., & Saeed, M. (2020) · IMF Working Paper · doi:10.5089/9781513544106.001 · Cited by 139
A decomposition-based many-objective evolutionary algorithm updating weights when required
Farias, L. R. C., & Araujo, A. F. R. (2021) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2021.100980 · Cited by 139
Gao, J., & Long, C. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3589282 · Cited by 139
Globally optimal vector quantizer design by stochastic relaxation
Zeger, K., Vaisey, J., & Gersho, A. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.124941 · Cited by 139
SOM-VAE: Interpretable Discrete Representation Learning on Time SeriesPreprint
Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., & Rätsch, G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.02199 · Cited by 140
Impact of similarity metrics on single-cell RNA-seq data clustering
Kim, T., Chen, I. R., Lin, Y., Wang, A. Y.-Y., Yang, J. Y. H., & Yang, P. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bby076 · Cited by 138
HireSome-II: Towards Privacy-Aware Cross-Cloud Service Composition for Big Data Applications
Dou, W., Zhang, X., Liu, J., & Chen, J. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.246 · Cited by 138
Gao, J. G., Zhang, Y., & Zhou, T. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.05.002 · Cited by 138
Towards a Characterisation of Smart Systems: A Systematic Literature Review
Romero, M., Guédria, W., Panetto, H., & Barafort, B. (2020) · Computers in Industry · doi:10.1016/j.compind.2020.103224 · Cited by 138
Fuzzy ART Neural Network Algorithm for Classifying the Power System Faults
Vasilic, S., & Kezunović, M. (2005) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2004.834676 · Cited by 138
How Fast Is the k-Means Method?
Har-Peled, S., & Sadri, B. (2004) · Algorithmica · doi:10.1007/s00453-004-1127-9 · Cited by 138
“SAME SAME BUT DIFFERENT”: REPLICATED ECOLOGICAL SPECIATION AT WHITE SANDS
Rosenblum, E. B., & Harmon, L. J. (2010) · Evolution · doi:10.1111/j.1558-5646.2010.01190.x · Cited by 137
Evolutionary Optimization of Radial Basis Function Classifiers for Data Mining Applications
Buchtala, O., Klimek, M., & Sick, B. (2005) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2005.847743 · Cited by 137
Metadata
- Authors
- Lloyd, S.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Lloyd, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-03
- Volume
- 28
- Issue
- 2
- Pages
- 129-137
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150593711
- Cited by
- 15,836
- References
- 9
- Citations by year
- 2026: 964 · 2025: 1161 · 2024: 1087 · 2023: 1243 · 2022: 1145 · 2021: 1244 · 2020: 1139 · 2019: 1089 · 2018: 887 · 2017: 731 · 2016: 662 · 2015: 573 · 2014: 524 · 2013: 488 · 2012: 507
- FWCI
- 29.12
- Type
- journal article
- Language
- en
- Open access
- green
- hal.science
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- HAL (submittedVersion, other-oa)
- IEEE Trans.
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Signal Processing Techniques
- Keywords
- pulse code modulation, optimal quantization, normal distribution, Laplacian distribution
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.