|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？
9 g) i* w1 t/ X6 G& CEncoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity' t4 B2 |2 u) j9 }: C: s$ s
Yi Kuang;
, r; d6 y7 \4 x' J* P# MSongsong Li;
* I! ^% T* [' K. D2 d: gShu Liu;; F9 D: F- z6 h" p
Liming Ma;4 x& B2 v% @7 x7 ^3 o; V
Chaoping Xing
2 Z, [! }7 R) A4 jIEEE Transactions on Information Theory
* ?) K' V2 r6 `Year: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
& \8 Q- ]0 N7 v! s- Q' j: U5 B# C8 p8 g m. p- Z
Abstract
" S5 `$ c" u* ^HTML
7 N: m. V* a' m" c- X$ k2 g4 F+ k% Z% E/ E4 L
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)" P' U/ a1 ~+ B7 {
Songsong Li;
) _# |& u3 T2 b% d% C) a8 n' U$ HShu Liu;
; n. I% ]! }0 W" E) o) e8 [Liming Ma;
+ o- O; T. A6 x; O9 t+ n% N$ e0 UYunqi Wan;6 k7 l" Q6 y; b* j, h8 h/ f
Chaoping Xing
& x9 L/ Z9 b9 R; q2 O; e5 t d0 aIEEE Transactions on Information Theory' s* ? |+ e( a! q6 Y
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE4 b- p/ L1 D, a: q3 \$ G& }* y
# j- v* z! i8 d* t3 e' O8 hAbstract$ V; H) @) w1 [2 |6 }. W B
HTML8 G2 A, w; T. Y: V
+ q! O- k1 j; K1 ?& c, ^9 {Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
# i; f C: j! a$ kShu Liu; k/ S, R9 \ L5 k
Ivan Tjuawinata;
& Q* u* V9 O& {! }Chaoping Xing
; p9 ]8 \% x+ n$ D8 _2 K- wIEEE Transactions on Information Theory8 |1 ^1 @8 c$ g/ H$ ~
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE' A. v ]! v3 e* c9 q
Cited by: Papers (4)
1 c2 X) {3 @ I0 D
& c$ |/ I) V% s2 P8 ]Abstract
; K9 E7 W# B. n' JHTML! ^0 d5 X' G n+ w4 U6 [$ x2 r+ n
. Y+ y8 ?$ y2 w& ~5 j( S& M& X# G4 {
A Lower Bound on the List-Decodability of Insdel Codes, L7 f0 r* v+ c# V5 y. w
Shu Liu;" M: b( L( w6 h# g8 Q k
Ivan Tjuawinata;
2 J$ Y; x" {. j) rChaoping Xing5 u+ B. K- m M" U; ^3 ]
IEEE Transactions on Information Theory7 z5 O2 H9 T0 |" N' b ~, q
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
( b$ N! C6 d# `: E
' V7 {4 b2 r9 s# z: UAbstract, d' C5 m9 g2 ?$ o
HTML' h m: V" h' X# L
) ] b4 m7 u; M+ o
A New Construction of Nonlinear Codes via Algebraic Function Fields9 c5 C; ~2 M" v4 x( _
Shu Liu;
& a% q+ c4 @! O/ u5 F1 zLiming Ma;" X+ ~6 ~" A) H; s! E5 C$ g6 Y
Ting-Yi Wu;# I9 ]6 O) {8 @/ \" N/ l! u# m
Chaoping Xing4 _& r: @0 E% |' O8 p: r4 ?3 F' q
IEEE Transactions on Information Theory( u4 s9 ^8 E; l
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
" \) F. {) t' {0 f4 tCited by: Papers (1)2 \( c) h* {1 V R, @# }
7 w# F- j1 R5 v( v0 SAbstract9 n8 B8 J. E* D5 u, p
HTML
9 J2 w3 ^) W6 s E1 \, c* z" W7 U- n3 w
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems6 e1 O# e% U' M6 Y1 @: ^- [/ c
Shu Liu;& p. m: X9 {! G1 h+ d D! u+ h7 g
Chaoping Xing
- s0 B/ U& J: PIEEE Transactions on Information Theory8 D# s; ]% ~2 t: U2 m
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE* @0 _) R0 ^+ g8 f
Cited by: Papers (2)
' d' n9 J$ ^+ h
( H) @$ z; B# YAbstract2 H9 y4 ?- a' {* ?7 Q
HTML
1 h1 W7 _4 y* }" P, z$ L9 w2 `, m% I- q
Bounds and Constructions for Insertion and Deletion Codes
. D. M: {* M% ]7 \1 K! ~/ TShu Liu; J0 [! t% z1 o
Chaoping Xing
I- v: X! P+ P! m1 [! X7 {* mIEEE Transactions on Information Theory
$ d0 _+ c* _9 E- v# Q8 S6 U) @Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
& Q, m- B+ {( Z! NCited by: Papers (14)
+ T, A3 u" N0 M3 u) m8 \/ O. ~0 l+ f, D2 X' P. t
Abstract: z1 j/ T: Q9 [2 u
HTML
- O$ t5 K. ?& q! E% p% X
! J8 X- h$ s2 A/ u }% _) zEfficiently List-Decodable Insertion and Deletion Codes via Concatenation3 l z3 W E8 @0 X
Shu Liu;
" p0 u' F. q" ?Ivan Tjuawinata;* C' D& r2 b* [- \' r0 x& F
Chaoping Xing
; N1 c# R% Z L% W4 EIEEE Transactions on Information Theory7 C1 ~1 g2 g# A
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
0 X# e8 t5 Z G5 ACited by: Papers (6)8 l4 j: U. [+ |' }) @5 k' w( A6 O! @
7 y$ p! M+ P7 W, p. h# [
Abstract
4 v+ o9 W2 i% y2 QHTML9 q, ]; J. T3 u' M
( \1 y8 s6 g' {! m: _ QExplicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
, K* ^, D( A! ~# LTai Do Duc;+ f" p# l& ], \- Q' W* Y: v3 b8 n/ j* R
Shu Liu;
- V% P% C! h0 \1 N! J+ `. SIvan Tjuawinata;
$ e5 Y7 E$ u+ B8 o2 l6 }' OChaoping Xing
+ N% O' P0 J( z+ ?% K$ V6 HIEEE Transactions on Information Theory/ U9 T$ m$ ^. T" V0 _+ a
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
H+ @$ M* y/ C% M0 q1 aCited by: Papers (17)! {0 u, K9 c! g) h
2 }- E5 Q7 @; B: l, _Abstract
% X9 H* j/ j+ |HTML
) b; b! {/ v! A& R
0 X0 y/ U) c3 j* p" b0 b [List Decodability of Symbol-Pair Codes+ u% S# N0 \2 X4 `# m3 X: B0 D
Shu Liu;) H; u' _0 b4 d3 ^& m* n0 d- a$ K
Chaoping Xing;* k: I# S+ M+ _$ v2 H
Chen Yuan1 q" j2 I+ t. V) T8 P3 i
IEEE Transactions on Information Theory
, G! [! m! g* bYear: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
- Y( } A& z! F8 T6 N0 g% j# HCited by: Papers (15)0 _) }7 C2 a: ^7 f- Q$ ^' g
8 ?2 P* I0 S% w. b9 l! Y
Abstract/ F+ i& |" h4 C$ \2 `* q% V
HTML1 I* V6 g7 L5 G. _
% Y1 e+ m/ c" ~: N8 ?3 YList Decoding of Cover Metric Codes Up to the Singleton Bound
; Q9 {+ |; n4 kShu Liu;
) p5 `4 o- K& ?- D* C1 ~2 ]+ \; F" [) GChaoping Xing;$ k& y0 _9 r+ n
Chen Yuan
4 _& y8 X8 X9 j6 P9 C9 O6 J/ `0 J7 eIEEE Transactions on Information Theory0 W& ]/ \7 @" `" l" `
Year: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE8 Y, r) q" O) C+ e0 x9 i
Cited by: Papers (7)
# c# J, E D( ^( m2 F$ T* F* P, q3 G: I& \
Abstract% x7 `; N) s5 l: R" f3 d" c
HTML& r' U; C6 a! H- U& e- b
* l0 {6 E% T7 |* D+ r
List Decodability of Random Subcodes of Gabidulin Codes
; l; r! D2 i/ h' H8 AShu Liu;
7 a3 c2 e- y. R. s+ h. O WChaoping Xing;
6 x# c8 C7 g4 GChen Yuan* N8 P% t) U! l! _: H
IEEE Transactions on Information Theory
& K# l3 q. p6 M0 J) k" e% ^Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE& w$ l& w! `) G3 Q2 q1 V/ ]
Cited by: Papers (5)' |1 ~4 f% g6 F! O: `' w
|
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主