Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Code point

Known as: Code position, Codepoint, Code points 
In character encoding terminology, a code point or code position is any of the numerical values that make up the code space. Many code points… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
  • J. C. Roh, B. Rao
  • IEEE Transactions on Signal Processing
  • 2006
  • Corpus ID: 10843077
This paper investigates the problem of transmit beamforming in multiple-antenna spatial multiplexing (SM) systems employing a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2005
2005
In this paper we describe a way to save and restore the state of a running Java program. We achieve this on the language level… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2005
2005
In this letter, we propose a fragile digital watermarking algorithm that is directly applicable to compressed bit streams and is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Highly Cited
2003
Highly Cited
2003
Punycode is a simple and efficient transfer encoding syntax designed for use with Internationalized Domain Names in Applications… Expand
Highly Cited
1999
Highly Cited
1999
The definition of PHBs (per-hop forwarding behaviors) is a critical part of the work of the Diffserv Working Group. This document… Expand
Highly Cited
1999
Highly Cited
1999
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are… Expand
Highly Cited
1996
Highly Cited
1996
Acknowledgments. Introduction. 1. The Vicissitudes of Therapy. 2. From Schizo Bypasses to Postmodern Impasses. 3. A Discursive… Expand
Highly Cited
1988
Highly Cited
1988
A linear algebraic interpretation is developed for previously proposed algorithm-based fault tolerance schemes. The concepts of… Expand
Highly Cited
1962
Highly Cited
1962
By refining Hamming's geometric sphere-packing model a new upper bound for nonsystematic binary error-correcting codes is found… Expand