Orange S.A.

About: Orange S.A. is a company organization based out in Paris, France. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 6735 authors who have published 9190 publications receiving 156440 citations. The organization is also known as: Orange SA & France Télécom.

Infinite types for distributed object interfaces

Abstract: In a previous work [12] we presented COB, an object calculus which features objects with dynamically changing service offers. We also defined a type system for interfaces and a typing discipline that guarantees that no object may experience an unexpected service request at run-time. In the present paper, we extend our type system such that it describes “infinite state” types. We define equivalence and subtyping relations over those types based on bisimulation and simulation relations. We also define an algorithm to decide the equivalence or the subtyping relation of two types.

Collective microoptics on fiber ribbon for optical interconnecting devices

Abstract: New microoptics are proposed to interconnect single-mode fiber (SMF) ribbons. These microoptics allow the increase of the fiber spot size. Low loss, wide misalignment tolerances, long working distance, and low cost could be achieved. The fabrication process and experimental results are presented.

Blue and green up-conversion in (Yb3+, Tb3+) co-doped fluorophosphate glasses

Abstract: Up-conversion processes are studied in (Yb 3+ , Tb 3+ ) co-doped fluorophosphate glasses. These glasses contain a large concentration of terbium fluoride, up to 36 mol%, and still luminesc. Samples are excited at 980 nm, within the Yb 3+ absorption band. For `low' Yb 3+ concentrations, i.e., below 16 mol%, the typical green luminescence of terbium is observed. With increasing Yb 3+ concentration, the green luminescence vanishes and a blue emission appears. Both emissions are due to a cooperative effect between two Yb 3+ ions.

Recent results and problems on constructions of linear codes from cryptographic functions

Abstract: Linear codes have a wide range of applications in the data storage systems, communication systems, consumer electronics products since their algebraic structure can be analyzed and they are easy to implement in hardware. How to construct linear codes with excellent properties to meet the demands of practical systems becomes a research topic, and it is an efficient way to construct linear codes from cryptographic functions. In this paper, we will introduce some methods to construct linear codes by using cryptographic functions over finite fields and present some recent results and problems in this area.