Log in

Relevant bibliographies by topics / Decoding performance

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Decoding performance'

Author: Grafiati

Published: 6 September 2023

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Decoding performance.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Decoding performance"

1

Ravi Kumar, Ch, and K. Padmaraju. "Hard Decision Decoding Performance Improved Using Turbo Product Codes." International Journal of Engineering & Technology 7, no. 3.12 (2018): 228. http://dx.doi.org/10.14419/ijet.v7i3.12.16030.

Full text

Abstract:

The performance of soft decision decoding, whose for which the design is complex, is superior to the performance of hard decision decoding. In this paper, we propose a turbo product code with a bit flip algorithm to improve the performance of hard decision decoding. The performance of hard decision decoding is improved with low complexity using multidimensional turbo product codes. The reliability of decoding in a communication system to detect and correct errors is discussed .Maximum a posterior probability (MAP) decoding is employed to improve the hard decision performance of turbo product c

APA, Harvard, Vancouver, ISO, and other styles

2

Liu, Hengyan, Limin Zhang, Wenjun Yan, and Qing Ling. "Neural-Network-Assisted Polar Code Decoding Schemes." Applied Sciences 12, no. 24 (2022): 12700. http://dx.doi.org/10.3390/app122412700.

Full text

Abstract:

The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance while maintaining low decoding steps, we introduce a neural network subcode that can achieve optimal decoding performance and combine it with the traditional fast SC decoding algorithm. While exploring how to combine neural network node (NNN) with R1, R0, single-parity checks (SPC), and Rep, we find that the decoding failed sometimes when the

APA, Harvard, Vancouver, ISO, and other styles

3

Kong, Lingjun, Haiyang Liu, Wentao Hou, and Bin Dai. "Improving Decodability of Polar Codes by Adding Noise." Symmetry 14, no. 6 (2022): 1156. http://dx.doi.org/10.3390/sym14061156.

Full text

Abstract:

This paper presents an online perturbed and directed neural-evolutionary (Online-PDNE) decoding algorithm for polar codes, in which the perturbation noise and online directed neuro-evolutionary noise sequences are sequentially added to the received sequence for re-decoding if the standard polar decoding fails. The new decoding algorithm converts uncorrectable received sequences into error-correcting regions of their decoding space for correct decoding by adding specific noises. To reduce the decoding complexity and delay, the PDNE decoding algorithm and sole neural-evolutionary (SNE) decoding

APA, Harvard, Vancouver, ISO, and other styles

4

Mu, Xiao Dong, Xiao Lin Niu, Shao Wang Shi, and Wei Song. "GPU-Based High Performance Terrain Compression." Applied Mechanics and Materials 321-324 (June 2013): 1234–37. http://dx.doi.org/10.4028/www.scientific.net/amm.321-324.1234.

Full text

Abstract:

It has been well accepted that compression is essential to the real-time visualization of large-terrain elevation data. To achieve efficient performance, a terrain compression method featuring high decoding speed is proposed in this paper. A combined prediction scheme is applied in the prediction stage. Golomb-Rice coding is then used to encode the residuals after the prediction stage. The style of the codeword is tailored to make the decoding process amenable to a GPU implementation. Then batching is used to further improve the decoding speed. The proposed method is easy to implement and simp

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Yingxian, Aijun Liu, Xiaofei Pan, Shi He, and Chao Gong. "A Generalization Belief Propagation Decoding Algorithm for Polar Codes Based on Particle Swarm Optimization." Mathematical Problems in Engineering 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/606913.

Full text

Abstract:

We propose a generalization belief propagation (BP) decoding algorithm based on particle swarm optimization (PSO) to improve the performance of the polar codes. Through the analysis of the existing BP decoding algorithm, we first introduce a probability modifying factor to each node of the BP decoder, so as to enhance the error correcting capacity of the decoding. Then, we generalize the BP decoding algorithm based on these modifying factors and drive the probability update equations for the proposed decoding. Based on the new probability update equations, we show the intrinsic relationship of

APA, Harvard, Vancouver, ISO, and other styles

6

Yao, Hanwen, Arman Fazeli, and Alexander Vardy. "List Decoding of Arıkan’s PAC Codes." Entropy 23, no. 7 (2021): 841. http://dx.doi.org/10.3390/e23070841.

Full text

Abstract:

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance of polar codes at short blocklengths is CRC precoding followed by successive-cancellation list decoding. This approach, along with various refinements thereof, has largely remained the state of the art in polar coding since it was introduced in 2011. Recently, Arıkan presented a

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Huan, Jingxuan Huang, and Ce Sun. "Improved Belief Propagation List Decoding for Polar Codes." Electronics 11, no. 15 (2022): 2458. http://dx.doi.org/10.3390/electronics11152458.

Full text

Abstract:

Polar codes have become the channel coding scheme for control channel of enhanced mobile broadband in the 5G communication systems. Belief propagation (BP) decoding of polar codes has advantages of low decoding latency and high parallelism but achieves worse bit error ratio (BER) performance compared with the successive cancellation list (SCL) decoding scheme. In this paper, an improved BP list (IBPL) decoding algorithm is proposed with comparable BER performance to SCL algoritm. Firstly, the optimal permuted factor graph is analyzed for polar codes, which improves the performance of the BP de

APA, Harvard, Vancouver, ISO, and other styles

8

Gautam, Abhilasha, Prabhat Thakur, and Ghanshyam Singh. "Analysis of Universal Decoding Techniques for 6G Ultra-Reliable and Low-Latency Communication Scenario." Future Internet 17, no. 4 (2025): 181. https://doi.org/10.3390/fi17040181.

Full text

Abstract:

Ultra-reliable and low-latency communication (URLLC) in 6G networks is characterized by very high reliability and very low latency to enable mission-critical applications. The ability of a coding scheme to support diverse use cases requires flexibility on the part of the decoder. High reliability and low latency require decoders with improved error rate performance and reduced complexity. This article investigates candidate universal decoding algorithms for 6G communication scenarios. Universal decoders work on a wide range of error-correcting codes, making them scalable for different communic

APA, Harvard, Vancouver, ISO, and other styles

9

Minja, Aleksandar, Dušan Dobromirov, and Vojin Šenk. "Bidirectional stack decoding of polar codes." Vojnotehnicki glasnik 69, no. 2 (2021): 405–15. http://dx.doi.org/10.5937/vojtehg69-29858.

Full text

Abstract:

Introduction/purpose: The paper introduces a reduced latency stack decoding algorithm of polar codes, inspired by the bidirectional stack decoding of convolutional codes and based on the folding technique. Methods: The stack decoding algorithm (also known as stack search) that is useful for decoding tree codes, the list decoding technique introduced by Peter Elias and the folding technique for polar codes which is used to reduce the latency of the decoding algorithm. The simulation was done using the Monte Carlo procedure. Results: A new polar code decoding algorithm, suitable for parallel imp

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Xiumin, Jinlong He, Jun Li, and Liang Shan. "Reinforcement Learning for Bit-Flipping Decoding of Polar Codes." Entropy 23, no. 2 (2021): 171. http://dx.doi.org/10.3390/e23020171.

Full text

Abstract:

A traditional successive cancellation (SC) decoding algorithm produces error propagation in the decoding process. In order to improve the SC decoding performance, it is important to solve the error propagation. In this paper, we propose a new algorithm combining reinforcement learning and SC flip (SCF) decoding of polar codes, which is called a Q-learning-assisted SCF (QLSCF) decoding algorithm. The proposed QLSCF decoding algorithm uses reinforcement learning technology to select candidate bits for the SC flipping decoding. We establish a reinforcement learning model for selecting candidate b

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Decoding performance"

1

Lee, L. H. C. "Convolutional code design and performance." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Xin. "Collaborative decoding and its performance analysis." [Gainesville, Fla.] : University of Florida, 2006. http://purl.fcla.edu/fcla/etd/UFE0013385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Granke, Daniel. "Decoding Acting Vocabulary." VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3110.

Full text

Abstract:

This paper compares seemingly similar words from a variety of acting teachers, and shows how it is impossible to draw clear comparisons between words that are often used as synonyms. The paper is a reflection of the journey from believing in translation to recognizing its impossibility. In Chapter 1 we focus on one of the most common elements in actor training, Attention/focus/concentration, and analyze the shades of meaning in those words and the difficulty of talking about them in isolation. In Chapter 2 we look at the way in which semiotic analysis can explain the words resistance to equiva

APA, Harvard, Vancouver, ISO, and other styles

4

Krishnamurthi, Sumitha. "Performance of Recursive Maximum Likelihood Turbo Decoding." Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1070481352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

CONDO, CARLO. "VLSI decoding architectures: flexibility, robustness and performance." Doctoral thesis, Politecnico di Torino, 2014. http://hdl.handle.net/11583/2544356.

Full text

Abstract:

Stemming from previous studies on flexible LDPC decoders, this thesis work has been mainly focused on the development of flexible turbo and LDPC decoder designs, and on the narrowing of the power, area and speed gap they might present with respect to dedicated solutions. Additional studies have been carried out within the field of increased code performance and of decoder resiliency to hardware errors. The first chapter regroups several main contributions in the design and implementation of flexible channel decoders. The first part concerns the design of a Network-on-Chip (NoC) serving as an

APA, Harvard, Vancouver, ISO, and other styles

6

Han, Junsheng. "Code representation and performance of graph-Based decoding." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3297580.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2008.<br>Title from first page of PDF file (viewed April 28, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

7

Abedi, Ali. "Invariance Properties and Performance Evaluation of Bit Decoding Algorithms." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/768.

Full text

Abstract:

Certain properties of optimal bitwise APP (A Posteriori Probability) decoding of binary linear block codes are studied. The focus is on the Probability Density Function (<i>pdf</i>) of the bit Log-Likelihood-Ratio (<i>LLR</i>). A general channel model with discrete (not necessarily binary) input and discrete or continuous output is considered. It is proved that under a set of mild conditions on the channel, the <i>pdf</i> of the bit <i>LLR</i> of a specific bit position is independent of the transmitted code-word. It is also shown that the <i>pdf</i> of a given bit <i>LLR</i>, when the

APA, Harvard, Vancouver, ISO, and other styles

8

Leong, Chi Wa. "Reduced complexity decoding and relative performance of turbo codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/mq23379.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sankaranarayanan, Sundararajan. "Iterative Decoding of Codes on Graphs." Diss., The University of Arizona, 2006. http://hdl.handle.net/10150/194618.

Full text

Abstract:

The growing popularity of a class of linear block codes called the low-density parity-check (LDPC) codes can be attributed to the low complexity of the iterative decoders, and their potential to achieve performance very close to the Shannon capacity. This makes them an attractive candidate for ECC applications in communication systems. This report proposes methods to systematically construct regular and irregular LDPC codes.A class of regular LDPC codes are constructed from incidence structures in finite geometries like projective geometry and affine geometry. A class of irregular LDPC codes a

APA, Harvard, Vancouver, ISO, and other styles

10

Yang, Tao Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Performance of iterative detection and decoding for MIMO-BICM systems." Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/26197.

Full text

Abstract:

Multiple-input multiple-output (MIMO) wireless technology is an emerging cost- effective approach to offer multiple-fold capacity improvement relative to the conven- tional single-antenna systems. To achieve the capacities of MIMO channels, MIMO bit-interleaved-coded-modulation (BICM) systems with iterative detection and decod- ing (IDD) are studied in this thesis. The research for this dissertation is conducted based on the iterative receivers with convolutional codes and turbo codes. A variety of MIMO detectors, such as a maximum a posteriori probability (MAP) detector, a list sphere detecto

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Decoding performance"

1

Shu, Lin. Soft-decision decoding techniques for linear block codes and their error performance analysis. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Shu, Lin. Soft-decision decoding techniques for linear block codes and their error performance analysis. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Shu, Lin. Soft-decision decoding techniques for linear block codes and their error performance analysis. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

United States. National Aeronautics and Space Administration., ed. Soft-decision decoding techniques for linear block codes and their error performance analysis. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xinwen, Wu, Rao, T. R. N. 1933-, and United States. National Aeronautics and Space Administration., eds. New double-byte error-correcting codes for memory systems. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xinwen, Wu, Rao, T. R. N. 1933-, and United States. National Aeronautics and Space Administration., eds. New double-byte error-correcting codes for memory systems. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Xinwen, Wu, Rao, T. R. N. 1933-, and United States. National Aeronautics and Space Administration., eds. New double-byte error-correcting codes for memory systems. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xinwen, Wu, Rao, T. R. N. 1933-., and United States. National Aeronautics and Space Administration., eds. New double-byte error-correcting codes for memory systems. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Castura, Jeff. Performance analysis and optimization of reduced complexity low density parity check decoding algorithms. National Library of Canada, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

G, Seetharaman, Feng G. L, and United States. National Aeronautics and Space Administration., eds. Communications and information research: Improved space link performance via concatenated forward error correction coding : program report on NASA subcontract. National Aeronautics and Space Administration, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Decoding performance"

1

Paire, J. T., P. Coulton, and P. G. Farrell. "Graph Configurations and Decoding Performance." In Cryptography and Coding. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45325-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Bounds on Error-Correction Coding Performance." In Error-Correction Coding and Decoding. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tomlinson, Martin, Cen Jung Tjhai, Marcel A. Ambroze, Mohammed Ahmed, and Mubarak Jibril. "Soft and Hard Decision Decoding Performance." In Error-Correction Coding and Decoding. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51103-0_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Trujillo, Rafael A., Antonio M. Vidal, Víctor M. García, and Alberto González. "Parallelization of Sphere-Decoding Methods." In High Performance Computing for Computational Science - VECPAR 2008. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92859-1_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Falcão, Gabriel, Leonel Sousa, Vitor Silva, and José Marinho. "Parallel LDPC Decoding on the Cell/B.E. Processor." In High Performance Embedded Architectures and Compilers. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-92990-1_28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Azevedo, Arnaldo, Cor Meenderinck, Ben Juurlink, et al. "Parallel H.264 Decoding on an Embedded Multicore Processor." In High Performance Embedded Architectures and Compilers. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-92990-1_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Benoit, Mylène, and Philippe Guisgand. "Decoding Effet Papillon, a Choreography for Three Dancers Inspired by the World of Video Games." In Performance and Posthumanism. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74745-9_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Knowles, Ric. "Encoding/Decoding Shakespeare: Richard III at the 2002 Stratford Festival." In A Companion to Shakespeare and Performance. Blackwell Publishing Ltd, 2007. http://dx.doi.org/10.1002/9780470996706.ch17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Akanksha, Gupta, Jain Anjana, and Vyavahare Prakash. "Performance Analysis and Comparison of Various Channel Decoding Techniques." In Smart Computing and Informatics. Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-5544-7_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zheng, Xiangping, Xinyuanmeng Yao, and Xiao Ma. "Performance Analysis of Maximum-Likelihood Decoding of Polar Codes." In Communications in Computer and Information Science. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-1568-8_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Decoding performance"

1

Zhou, Chuang, Yang Li, Li Ma, et al. "Integrated high-performance LDPC decoder for Continuous-Variable Quantum Key Distribution System." In Optical Fiber Communication Conference. Optica Publishing Group, 2025. https://doi.org/10.1364/ofc.2025.th2a.62.

Full text

Abstract:

The throughput of the error correction decoding is one of the major bottlenecks of high-speed continuous-variable quantum key distribution (CV-QKD) systems and an integrated decoder with Gbps decoding throughput is implemented in this work.

APA, Harvard, Vancouver, ISO, and other styles

2

Xu, Xinyan. "Turbo Decoding Theory: Derivation and Performance Evaluation." In 2024 4th Asia-Pacific Conference on Communications Technology and Computer Science (ACCTCS). IEEE, 2024. http://dx.doi.org/10.1109/acctcs61748.2024.00146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

D, Archana, Deepthi Sri R, Deva Dharani P, Haripriya S, and Vimala Varshini C P. "Decoding Mobile App Performance with Explainable AI (XAI)." In 2024 International Conference on Smart Systems for Electrical, Electronics, Communication and Computer Engineering (ICSSEECC). IEEE, 2024. http://dx.doi.org/10.1109/icsseecc61126.2024.10649407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wan, Li, and Wenyi Zhang. "Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Xihao, Wenhao Chen, Li Chen, Yuan Li, and Huazi Zhang. "Order Skipping Ordered Statistics Decoding and its Performance Analysis." In 2024 IEEE Information Theory Workshop (ITW). IEEE, 2024. https://doi.org/10.1109/itw61385.2024.10807042.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Sheng, Xingjian Yi, and Wenjie Yao. "Performance of Different Polar Code Decoding Over NOMA Systems." In 2024 IEEE 10th International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications (MAPE). IEEE, 2024. https://doi.org/10.1109/mape62875.2024.10813662.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Haoran, Yuming Li, Haobo Xu, et al. "LAD: Efficient Accelerator for Generative Inference of LLM with Locality Aware Decoding." In 2025 IEEE International Symposium on High Performance Computer Architecture (HPCA). IEEE, 2025. https://doi.org/10.1109/hpca61900.2025.00111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Herrmann, Matthias, Saleem Alreesh, Chris Fludger, et al. "Impact of Line-side and Client-side Errors Using Iterative and Non-Iterative Decoding for Concatenated KP4-BCH FEC." In Optical Fiber Communication Conference. Optica Publishing Group, 2025. https://doi.org/10.1364/ofc.2025.tu2f.5.

Full text

Abstract:

We analyze the performance of iterative and non-iterative decoding of concatenated KP4-BCH FEC. Client-side errors at the transmitter lead to discrepancies between BCH and RS decoders. Nevertheless, iterative decoding improves the tolerance to client-side errors.

APA, Harvard, Vancouver, ISO, and other styles

9

Jia Li, Gaigai Yang, and Zhiqiang Zhao. "An improved-performance decoding algorithm of LDPC codes for layered decoding." In 2014 IEEE International Conference on Communication Problem-Solving (ICCP). IEEE, 2014. http://dx.doi.org/10.1109/iccps.2014.7062283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bayanifar, Mahdi, Robert Calderbank, and Olav Tirkkonen. "Performance Analysis of Binary Chirp Decoding." In 2023 IEEE Information Theory Workshop (ITW). IEEE, 2023. http://dx.doi.org/10.1109/itw55543.2023.10161617.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Decoding performance"

1

McEliece, Robert, and Padhraic Smyth. Turbo Decoding of High Performance Error-Correcting Codes via Belief Propagation. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada386835.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Haney, Michael W. The Application of Free-Space Optical Interconnects to High Performance Communication Decoding. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada373463.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Decoding Talent : Talent Management in the Indian Social Sector. Development Management Foundation, 2022. http://dx.doi.org/10.58178/202219832016.

Full text

Abstract:

Talent management (TM) has a direct association with organisational performance. In SPOs, this association is of greater strategic importance as the human hand cannot be replaced by technology or greater financial resources. Thus, for any SPO, achieving its mission heavily relies on its personnel's talent, which is "the total of all the experience, knowledge, skills, and behaviours that a person has and brings to work." However, the exploration of TM in SPOs is largely uncharted territory.

APA, Harvard, Vancouver, ISO, and other styles

4

Decoding Talent: Talent Management in the Indian Social Sector. Indian School Of Development Management, 2022. http://dx.doi.org/10.58178/2209.1013.

Full text

Abstract:

Talent management (TM) has a direct association with organizational performance. In SPOs, this association is of greater strategic importance as the human hand cannot be replaced by technology or greater financial resources. Thus, for any SPO, achieving its mission heavily relies on its personnel's talent, which is ""the total of all the experience, knowledge, skills, and behavior's that a person has and brings to work."" However, the exploration of TM in SPOs is largely uncharted territory. To overcome this gap in the Indian social sector, the ISDM and CSIP - Ashoka University jointly conduct

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!