|
|
|
Publications in Math-Net.Ru |
Citations |
|
2006 |
| 1. |
V. V. Slabko, G. G. Khachatryan, A. S. Aleksandrovskii, “Self-organized aggregation of small metal particles controlled by an external light field”, Pis'ma v Zh. Èksper. Teoret. Fiz., 84:6 (2006), 360–364  ; JETP Letters, 84:6 (2006), 300–304   |
21
|
|
1991 |
| 2. |
L. A. Agalovyan, G. G. Khachatryan, “Об асимптотическом методе решения краевых задач теории упругости для неклассических областей”, Issled. Teor. Plastin i Obolochek, 23 (1991), 17–21  |
|
1989 |
| 3. |
S. S. Martirosyan, G. G. Khachatryan, “Construction of Signature Codes and the Coin Weighing Problem”, Probl. Peredachi Inf., 25:4 (1989), 96–97  ; Problems Inform. Transmission, 25:4 (1989), 334–335 |
1
|
|
1988 |
| 4. |
G. G. Khachatryan, “$\sigma$-Decodable Code Constructions for a $T$-User Adder Channel”, Probl. Peredachi Inf., 24:2 (1988), 94–99 ; Problems Inform. Transmission, 24:2 (1988), 159–163 |
1
|
|
1985 |
| 5. |
G. G. Khachatryan, “Codes for a Two-User Adder Channel”, Probl. Peredachi Inf., 21:1 (1985), 105–109 |
|
1983 |
| 6. |
G. G. Khachatryan, “Decoding for a Noiseless Channel with Two Users”, Probl. Peredachi Inf., 19:2 (1983), 8–13 ; Problems Inform. Transmission, 19:2 (1983), 91–96 |
|
1981 |
| 7. |
G. G. Khachatryan, “Construction of a Linear Pair of Uniquely Decodable Codes for a Noiseless Two-User Channel”, Probl. Peredachi Inf., 17:2 (1981), 98–101 |
|
| Organisations |
|
| |
|
|
Contact us: